2^x mod n = 1（欧拉定理，欧拉函数，快速幂乘）
摘要：
2^x mod n = 1Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9231Accepted Submission(s): 2837Problem DescriptionGive a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.InputOne positive integer on each line, the value of n.OutputIf 阅读全文
posted @ 2013-08-23 11:22 铁树银花 阅读(3554) 评论(0) 推荐(1) 编辑
