Give a number n, find the minimum x that satisfies 2x 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
题目大意:
给定n,寻找满足2x mod n = 1的最小正整数x。
核心思想:
如果n是偶数,即2x和n都是2的倍数,那么取模不可能得到1。
如果n是奇数,根据费马小定理:
若a和p互素,则ap-1 mod p = 1。
答案一定存在,且0<x<=n-1。
从1开始暴力枚举,余数为1就break。
代码如下:
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n;
while(scanf("%lld",&n)!=EOF)
{
if(n==1||n%2==0)
{
printf("2^? mod %lld = 1\n",n);
continue;
}
ll t=1,i=0;
for(i=1;;i++)
{
t=(t*2)%n;
if(t==1)
break;
}
printf("2^%lld mod %lld = 1\n",i,n);
}
return 0;
}