2^x mod n = 1
Problem Description
Give a number n, find the minimum x(x>0) 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
分析:偶数的时候,肯定是不存在的,1的时候也不存在,奇数时,就一个一个找就可以了。
代码如下:
#include<cstdio> int main() {__int64 n; __int64 s,x,i; while(~scanf("%I64d",&n)) {if(n==1||(n&1)==0) printf("2^? mod %I64d = 1\n",n); else { s=1; for(x=1;;++x) {s=s*2%n; if(s==1) {printf("2^%I64d mod %I64d = 1\n",x,n);break;} } } } return 0; }