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<math.h>
int main()
{
int n;
while(~scanf("%d",&n))
{
if(n%2==0||n==1)
printf("2^? mod %d = 1\n",n);
else
{
int m=1,t=2;
while(t%n!=1)
{
t=t*2%n;
m++;
}
printf("2^%d mod %d = 1\n",m,n);
}
}
return 0;
}
题意 给你一个数N,判断是否存在x,满足2^x mod N = 1。若满足,对于满足条件的最小x,输出2^x mod N = 1,
思路 两种情况当n为1或n为偶数时直接输出n当n为奇数时为一种情况公式为(a*b)%c==(a%c * b%c)%c.