hduoj1395(2^x mod n = 1)（属于费马定理）

最新推荐文章于 2023-04-08 20:46:12 发布

萧雅的梦

最新推荐文章于 2023-04-08 20:46:12 发布

阅读量412

点赞数

分类专栏：基础的C语言编程和知识

本文链接：https://blog.csdn.net/bestxyj/article/details/44101339

版权

基础的C语言编程和知识专栏收录该内容

36 篇文章 0 订阅

订阅专栏

#include<stdio.h>
2^x mod n = 1
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13285    Accepted Submission(s): 4127



 
 
  
  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

int main()
{
    int n,m,i,k;
    while(scanf("%d",&n)!=EOF)
    {
        if(n%2==0||n==1)
        printf("2^? mod %d = 1\n",n);
        else
        {
            k=1;
            for(i=1; ;i++)
            {
                     k=k*2;
                     if(k%n==1)
                     {
                               m=i;
                               break;
                     }
                     k=k%n;
            }
            printf("2^%d mod %d = 1\n",m,n);
        }
    }
    return 0;
}