快速幂算法
titi2018815
菜鸟正在一步步成长!
展开
-
Raising Modulo Numbers POJ - 1995
题目: 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 ga...原创 2019-10-19 15:59:54 · 116 阅读 · 0 评论 -
Pseudoprime numbers POJ - 3641
题目: Fermat's theorem states that for any prime numberpand for any integera> 1,ap=a(modp). That is, if we raiseato thepthpower and divide byp, the remainder isa. Some (but not very m...原创 2019-10-19 10:02:05 · 108 阅读 · 0 评论