HUD1395“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

题意：
求解x。

思路：
若n为2的倍数或者为1，即等式无解；反之，求2的m次方（不大于n+1，若大于，取余），若等于n+1，则求出等式最小解，否则继续求2的（m+1）次方。

#include<iostream>
#include<math.h>
#include<string>
#include<time.h>
#include<cstring>
using namespace std;
const int Max=10000000;
int main(){
	int n,x;
	while(cin>>n){
		if(n==1||n%2==0)
			printf("2^? mod %d = 1\n",n);
		else{
			int s=2,i,m=1;
			for(i=1;;i++){
				s*=2;
				m++;
				if(s==n+1)
					break;
				if(s>=n)
					s%=n;
			}
			printf("2^%d mod %d = 1\n",m,n);
		}
	}
    return 0;
}