2^x mod n = 1 hdoj 1395

2^x mod n = 1
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11573    Accepted Submission(s): 3592




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
 


Author
MA, Xiao
 


Source
ZOJ Monthly, February 2003 


/*
同余定理
*/


#include<cstdio>
#include<stdlib.h>
const int max=10000;//数不要开太大
int main()
{
__int64 n;
while(~scanf("%I64d",&n))
{

int p,i;
__int64 s=2;
for(i=1,s=2,p=0;i<max;i++)
 {
    s%=n;
  if(s%n==1)
     {
p=1;
printf("2^%d mod %I64d = 1\n",i,n);
     break;
     }
          s*=2;
 }
 if(p==0)
           printf("2^? mod %I64d = 1\n",n);
}
system("pause");
return 0;
}