4619: Sumdiv
内存限制：128 MB
时间限制：1 S
标准输入输出
题目类型：传统
评测方式：文本比较
上传者：
提交：2
通过：0
题目描述
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
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