Happy 2004 HDU - 1452 积性函数+逆元+快速幂

最新推荐文章于 2021-08-09 13:12:06 发布

小郑￥

最新推荐文章于 2021-08-09 13:12:06 发布

阅读量172

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/HXX904/article/details/99468853

版权

数论专栏收录该内容

17 篇文章 0 订阅

订阅专栏

问题：

Consider a positive integer X,and let S be the sum of all positive integer divisors of 2004^X. Your job is to determine S modulo 29 (the rest of the division of S by 29).

Take X = 1 for an example. The positive integer divisors of 2004^1 are 1, 2, 3, 4, 6, 12, 167, 334, 501, 668, 1002 and 2004. Therefore S = 4704 and S modulo 29 is equal to 6.

Input

The input consists of several test cases. Each test case contains a line with the integer X (1 <= X <= 10000000).

A test case of X = 0 indicates the end of input, and should not be processed.

Output

For each test case, in a separate line, please output the result of S modulo 29.

Sample Input

1
10000
0

Sample Output

6
10

题意：2004^x的所有正因数的和(S)对29求余；输出结果；

思路：积性函数，当gcd(a,b)=1时s(ab)=s(a)s(b);

如果p是素数 s(p^n)=1+p+p^2+...+p^n=(p^(n+1)-1) /(p-1) (1)

2004=2^2 3 167

s(2004^X) ) = (s(2^2X))) (s(3^X))) (s(167^X)))

167%29=22;

s(2004^X) ) = (s(2^2X))) (s(3^X))) (s(22^X)))

a=s(2^2X)=(2^(2X+1)-1)//根据（1）

b=s(3^X)= (3^(X+1)-1)/2//根据（1）

c=s(22^X)= (22^(X+1)-1)/21//根据（1）

%运算法则 1. (ab) %p= ( a%p) (b%p)

%运算法则 2. (a/b) %p= ( a *b^(-1)%p)

2的逆元是15

21的逆元是18

因此

a=（powi(2,2*x+1,29)-1）%29;

b=(powi(3,x+1,29)-1)*15 %29;

c=(powi(22,x+1,29)-1)*18 %29;

ans=（ab）% 29c % 29;

代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef __int64 ll;
ll pow(int x,int y)
{
    x=x%29;
    int sum=1;
    while(y>0)
    {
        if(y%2!=0)
            sum=(sum*x)%29;
        x=x*x%29;
        y=y/2;
    }
    return sum%29;
}
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        ll a=(pow(2,2*n+1)-1)%29;
        ll b=(pow(3,n+1)-1)*15%29;
        ll c=(pow(22,n+1)-1)*18%29;
        printf("%I64d\n",a*b%29*c%29);
    }
}