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>//暴力,知道两点1,偶数肯定找不到,奇数肯定能找到;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==1||n%2==0)
{
printf("2^? mod %d = 1\n",n);
}
else
{
int i=1;
int s=2;
while(s!=1)
{
i++;
s=s*2;
s%=n; //即s-s/n*n,s/n*n乘以二的倍数后依旧是 n的倍数,因此减去无影响;
}
printf("2^%d mod %d = 1\n",i,n);
}
}
}