2^x mod n = 1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16592 Accepted Submission(s): 5165
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
一直超时,没有每次都取余
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,i;
while(scanf("%d",&n)!=EOF)
{
int s=1,m;
if(n==1||n%2==0)
{
printf("2^? mod %d = 1\n",n);
continue;
}
for(i=1;;i++)
{
s=s*2;
s=s%n;//每次取余防止溢出
if(s==1)
{
m=i;
break;
}
}
printf("2^%d mod %d = 1\n",m,n);
}
return 0;
}