Sumdiv(同余模运算、素因子分解、递归二分求等比数列、快速幂)
题目描述:
Consider two natural numbers A and B. Let S be the sum of all natural divisors of A^BA
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)separ
原创
2020-06-25 22:41:48 ·
290 阅读 ·
0 评论