2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1.
Input
One positive integer on each line, the value of n.
Output
If the minimum x exists, print a line with 2^x mod n = 1.
Print 2^? mod n = 1 otherwise.
You should replace x and n with specific numbers. ...
/dl/159576.html
标签：
mod
satisfies
minimum
number
上传时间：
2015-06-02
上传用户：qlpqlq
