HDU 1539 2^x mod n = 1 (欧拉函数)

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

Author

MA, Xiao

Source

ZOJ Monthly, February 2003

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
map<int,int>vis;
int main()
{
    int n,x,temp;
    while(scanf("%d",&n)!=EOF) {
//        vis.clear();
        temp=2;
        if(n==1 || n%2==0) {
            printf("2^? mod %d = 1\n",n);
            continue;
        }
        for(x=1;;x++) {
            temp=temp%n;
    //        if(vis[temp]) break;
            if(temp==1) break;
    //        vis[temp]=1;
            temp*=2;
        }
        if(temp%n==1) printf("2^%d mod %d = 1\n",x,n);
        else printf("2^? mod %d = 1\n",n);
    }
    return 0;
}