zcmu.oj-1293: 2^x mod n = 1

Description

Give a number n, find the minimum x 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.

代码：

#include<stdio.h>
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n==1||n%2==0)     //考虑到n=1 和 n为偶数时可以被2^j整除； 
        {
            printf("2^? mod %d = 1\n",n);
            continue;      //是循环继续而不是终止循环
        }
        int t = 2;
        int i = 1;
        while( t!=1 )  //核心算法
        {
            i++;
            t *= 2;
            t = t % n;
        }
        printf("2^%d mod %d = 1\n",i,n);
    }
    return 0;
}