CF1017F.The Neutral Zone

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Notice: unusual memory limit!

After the war, destroyed cities in the neutral zone were restored. And children went back to school.

The war changed the world, as well as education. In those hard days, a new math concept was created.

As we all know, logarithm function can be described as: $$$$ \log(p_1{a_1}p_2{a_2}...p_k^{a_2}) = a_1 \log p_1 + a_2 \log p_2 + ... + a_k \log p_k $$ Where p_1a_1p_2a_2...p_ka_2p\_1^{a\_1}p\_2^{a\_2}...p\_k^{a\_2} is the prime factorization of a integer. A problem is that the function uses itself in the definition. That is why it is hard to calculate.

So, the mathematicians from the neutral zone invented this: $$ \text{exlog}f(p_1{a_1}p_2{a_2}...p_k^{a_2}) = a_1 f(p_1) + a_2 f(p_2) + ... + a_k f(p_k) $$

Notice that textexlog_f(1)\\text{exlog}\_f(1) is always equal to 00 .

This concept for any function ff was too hard for children. So teachers told them that ff can only be a polynomial of degree no more than 33 in daily uses (i.e., f(x)=Ax3+Bx2+Cx+Df(x) = Ax^3+Bx^2+Cx+D ).

"Class is over! Don't forget to do your homework!" Here it is: $$ \sum{i=1}^n \text{exlog}_f(i) $$

Help children to do their homework. Since the value can be very big, you need to find the answer modulo 2322^{32}$$.

输入格式

The only line contains five integers nn , AA , BB , CC , and DD ( 1n31081 \le n \le 3 \cdot 10^8 , 0A,B,C,D1060 \le A,B,C,D \le 10^6 ).

输出格式

Print the answer modulo 2322^{32} .

输入输出样例

  • 输入#1

    12 0 0 1 0
    

    输出#1

    63
    
  • 输入#2

    4 1 2 3 4
    

    输出#2

    136
    

说明/提示

In the first sample:

exlogf(1)=0\text{exlog}_f(1) = 0

exlogf(2)=2\text{exlog}_f(2) = 2

exlogf(3)=3\text{exlog}_f(3) = 3

exlogf(4)=2+2=4\text{exlog}_f(4) = 2 + 2 = 4

exlogf(5)=5\text{exlog}_f(5) = 5

exlogf(6)=2+3=5\text{exlog}_f(6) = 2 + 3 = 5

exlogf(7)=7\text{exlog}_f(7) = 7

exlogf(8)=2+2+2=6\text{exlog}_f(8) = 2 + 2 + 2 = 6

exlogf(9)=3+3=6\text{exlog}_f(9) = 3 + 3 = 6

exlogf(10)=2+5=7\text{exlog}_f(10) = 2 + 5 = 7

exlogf(11)=11\text{exlog}_f(11) = 11

exlogf(12)=2+2+3=7\text{exlog}_f(12) = 2 + 2 + 3 = 7

$ \sum_{i=1}^{12} \text{exlog}_f(i)=63 $

In the second sample:

exlogf(1)=0\text{exlog}_f(1) = 0

exlogf(2)=(1×23+2×22+3×2+4)=26\text{exlog}_f(2) = (1 \times 2^3 + 2 \times 2^2 + 3 \times 2 + 4) = 26

exlogf(3)=(1×33+2×32+3×3+4)=58\text{exlog}_f(3) = (1 \times 3^3 + 2 \times 3^2 + 3 \times 3 + 4) = 58

exlogf(4)=2×exlogf(2)=52\text{exlog}_f(4) = 2 \times \text{exlog}_f(2) = 52

$ \sum_{i=1}^4 \text{exlog}_f(i)=0+26+58+52=136 $

首页