HDOJ 题目1452 Happy 2004（）

Happy 2004

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1039    Accepted Submission(s): 742

Problem Description

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
  
  

 

Source

ACM暑期集训队练习赛（六）

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   1573  1788  1370  1852  1796 

 

求约数的和
首先 约束和函数是积性函数(就是如果m,n互质，则 f(mn)=f(m)f(n))
  还有约数个数函数也是积性函数 这2个比较好证明 直接带入就可以
S(x)代表x的约数和
S(20)=S(4)*S(5)
如果p是素数 S(p^n)=1+p+p^2+...p^n=(p^(n+1)-1)/(p-1);
所以本题 S(2004^x)=(2^(2*x+1)-1)(3^(x+1)-1)/2*(167^(x+1)-1)/166

ac代码

#include<stdio.h>
#include<string.h>
#define mod 29
int ppow(int a,int b)
{
	int s=1;
	while(b)
	{
		if(b&1)
			s=s*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return s;
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF,n)
	{
		int a,b,c;
		a=(ppow(2,2*n+1)-1)%mod;
		b=(ppow(3,n+1)-1)%mod*15%mod;//15是2的mod 29逆
		c=(ppow(167,n+1)-1)%mod*18%mod;//18是 21的mod 29逆
		printf("%d\n",a*b%mod*c%mod);
	}
}