zoj1489-2^x mod n = 1

来源：互联网发布：网络运营外包公司编辑：程序博客网时间：2024/04/28 12:41

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=489

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

#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<bitset>using namespace std;int main(){int n ;while( cin >> n ){if( n % 2 == 0 || n < 2 ){cout << "2^? mod "<< n <<" = 1" << endl;continue ;}bool flag = false ;int sum = 1;for( int i = 1 ; ; ++i ){sum = 2 * sum ;if( sum % n == 1 ){cout << "2^" << i << " mod "<< n <<" = 1" << endl;flag = true ;break ;}sum %= n ;}if( !flag )cout << "2^? mod "<< n <<" = 1" << endl;;} return 0 ;}