2^x mod n = 1 acm競(jìng)賽題 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.
Sample Input
2
5
Sample Output
2^? mod 2 = 1
2^4 mod 5 = 1
標(biāo)簽：
mod
satisfies
minimum
number
上傳時(shí)間：
2015-06-02
上傳用戶(hù)：qlpqlq
