F - 2^x mod n = 1 HDU - 1395

2^x mod n = 1

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21451 Accepted Submission(s): 6725

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

思路：

1. 取模运算，每次取模数据不会溢出。
2. 这道题开始写的时候发现时间超时，然后用快速幂，提交后还超时。
3. 找规律发现遍历n一个循环，然后优化一直超时，提交了数次。浪费了很多时间，大意了。

AC：

#include<iostream>
using namespace std;
int main(){
	int n;
	while(cin>>n){
		if(n%2==0||n==1){
			cout<<"2^? mod "<<n<<" = 1"<<endl;
		}else{
			int ans = 1,k=0;
			while(1){
				k++;
				ans = (ans*2)%n;
				if(ans==1){
					break;
				}
			}
			cout<<"2^"<<k<<" mod "<<n<<" = 1"<<endl;
		}
	}
	return 0;
}