与‘数值- 整数快速幂取模’有关的日志

poj1995

maksyuki 发表于 oj 分类,标签:
0
poj1995

Raising Modulo Numbers

People are different. Some secretly read magazines full of interesting girls' pictures, others create an A-bomb in their cellar, others like using Windows, and some like difficult mathematical games. Latest marketing research >>继续阅读

poj1845

maksyuki 发表于 oj 分类,标签: , ,
0
poj1845

Sumdiv

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).

Input

The only line contains the two natural numbers A and B, (0 <= A,B <= 5000 >>继续阅读

lightoj1054

maksyuki 发表于 oj 分类,标签: , ,
0
lightoj1054

1054 - Efficient Pseudo Code

pseudo codeSometimes it's quite useful to write pseudo codes for problems. Actually you can write the necessary steps to solve a particular problem. In this problem you are given a pseudo code to solve a problem and you >>继续阅读