HDU 1452 Happy 2004
来源:互联网 发布:编程算法是什么 编辑:程序博客网 时间:2024/05/20 07:35
题目链接 : HDU1452
Happy 2004
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 766 Accepted Submission(s): 535
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.
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.
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
1100000
Sample Output
610
Source
ACM暑期集训队练习赛(六)
Recommend
lcy
数学题。先暴力打表吧
#include<cmath>#include<cstdlib>#include<algorithm>#include<string>#include<vector>#include<iostream>#include<map>using namespace std;int num[]={6,16,8,10,25,7,14,3,23,17,13,17,0,27,7,14,15,17,26,26,20,17,9,22,22,23,0,1};int main(){ int n; while(scanf("%d",&n)) { if(n==0) break; printf("%d\n",num[(n-1)%28]); } return 0;}
- hdu 1452 Happy 2004
- HDU 1452 Happy 2004
- hdu 1452 Happy 2004
- hdu 1452 Happy 2004
- HDU 1452 Happy 2004
- hdu 1452 happy 2004
- HDU 1452 Happy 2004
- 【HDU】 1452 Happy 2004
- HDU 1452 Happy 2004
- HDU 1452 Happy 2004
- G - Happy 2004------(HDU 1452)
- HDU 1452 Happy 2004 快乐2004
- HDU 1452——Happy 2004
- HDU 1452 Happy 2004(因子和)
- hdu 1452 Happy 2004 因子和
- hdu 1452 Happy 2004(快速幂取模)
- hdu 1452 Happy 2004(积性函数)
- HDU 1452 Happy 2004 (因子和)
- 快速排序算法原理与实现
- Linux系统串口接收数据编程
- 设置当前进程优先级
- 创业者应避免对投资者说的五句话
- IE6里样式表不起作用解决方法
- HDU 1452 Happy 2004
- 循环与数组问题3
- zookeeper原理 使用场景
- PB webForm中用js实现选中行突出显示
- struts2源码阅读第一天
- css3.0实现背景旋转的方法
- 数据库如何抵抗随机IO:问题、方法与现实
- Jvm GC分代
- C++获取文件大小