OpenJudge

09:Sumdiv

总时间限制:
1000ms
内存限制:
65536kB
描述
Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).
输入
The only line contains the two natural numbers A and B, (0 <= A,B <= 50000000)separated by blanks.
输出
The only line of the output will contain S modulo 9901.
样例输入
2 3
样例输出
15
提示
2^3 = 8.
The natural divisors of 8 are: 1,2,4,8. Their sum is 15.
15 modulo 9901 is 15 (that should be output).
来源
Romania OI 2002
全局题号
847
添加于
2017-04-27
提交次数
43
尝试人数
12
通过人数
9