poj-2429 Miller_Rabin强伪素数测试 +pollard_rho质因数分解
题目:GCD & LCM InverseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17978 Accepted: 3331DescriptionGiven two positive integers a and b, we can easily calculate the greatest common diviso...
原创
2018-04-27 22:58:46 ·
369 阅读 ·
0 评论