HDU - 1395 2^x mod n = 1（欧拉定理）

2^x mod n = 1

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

题意：给定一个数 n ，求等式  2^x % n = 1 .按要求输出。

思路：欧拉定理有   其中 a 与 n 互质。求出的欧拉函数可能并不是这个方程最小的解。它的解有可能在它的因子中，分解因子然后挨个用快速幂check。

AC代码：

#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define ull unsigned LL
#define ls i << 1
#define rs (i << 1) + 1
#define INT(t) int t; scanf("%d",&t)

using namespace std;

int Euler(int n){
    int ans = n;
    for(int i = 2;i * i <= n;++ i){
        if(n % i == 0){
            ans = ans / i * (i - 1);
            while(n % i == 0) n /= i;
        }
    }
    if(n > 1) ans = ans / n * (n - 1);
    return ans;
}

vector<int> yz;
void factor(int n){
    for(int i = 1;i * i <= n;++ i){
        if(n % i == 0){
            yz.pb(i);
            if(i != n / i)
                yz.pb(n / i);
        }
    }
}

bool quick_pow(LL a,LL b,LL p){
    LL ans = 1;
    while(b){
        if(b & 1) (ans *= a) %= p;
        (a *= a) %= p;
        b >>= 1;
    }
    return ans == 1LL;
}

int main() {
    int n;
    while(~scanf("%d",&n)){
        if(n % 2 == 0 || n == 1)
            printf("2^? mod %d = 1\n",n);
        else {
            yz.clear();
            factor(Euler(n));
            sort(yz.begin(),yz.end());
            for(auto it : yz){
                if(quick_pow(2,it,n)){
                    printf("2^%d mod %d = 1\n",it,n);
                    break;
                }
            }
        }
    }
    return 0;
}