题意很好懂 ,就不翻译了
2^x mod n = 1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12088 Accepted Submission(s): 3775
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.
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
ac代码:
#include<stdio.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n%2==0||n==1) //先判断n是不是2的倍数
{
printf("2^? mod %d = 1\n",n);
continue;
}
int x=1,s=2,i;
for(i=1;;i++)
{
x++;
s*=2;
if(s==n+1) break;
if(s>=n)
s%=n;
}
printf("2^%d mod %d = 1\n",x,n);
}
return 0;
}