杭电OJ 2^x mod n = 1

2^x mod n = 1

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

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

 

#include <stdio.h>

int main()
{
	int n ;
	while(~scanf("%d",&n))
	{
		if(n==1 || n%2==0)
		{
			printf("2^? mod %d = 1\n",n);
		}
		else
		{
			int j = 1, mi=2;
			while(1)
			{
				mi %= n ;
				if(mi == 1)
				{
					printf("2^%d mod %d = 1\n",j,n) ;
					break ;
				}
				mi *= 2 ;
				++j ;
			}
		}
	}
	return 0 ;
}

Source

ZOJ Monthly, February 2003

 

Recommend

Ignatius.L   |   We have carefully selected several similar problems for you:   2462  2421  2521  1695  2466



原网站: http://www.myexception.cn/program/1859821.html