zoj 1489 2^x mod n = 1

#include <iostream>#include <string.h>#include <math.h>using namespace std;#define MAX 25int main(){int n;while (cin>>n){if((n&1)==0||n==1)cout<<"2^? mod "<<n<<" = 1n";else{int ii=0;int sum=1;while(1){++ii;int temp = 2%n;sum = sum*temp;sum = sum%n;if(sum==1)break;}cout<<"2^"<<ii<<" mod "<<n<<" = 1n";}}return 0;}