Description
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
#include <cstdio>
int main()
{
int n;
while(~scanf("%d", &n)) {
if(n%2==0 || n==1) { printf("2^? mod %d = 1\n", n); continue; }
int cnt = 1, sum = 2;
while(sum != 1) {
sum = sum*2%n;
cnt++;
}
printf("2^%d mod %d = 1\n", cnt, n);
}
return 0;
}