杭电13952^x mod n = 1
来源:互联网 发布:手机回看电视软件 编辑:程序博客网 时间:2024/04/30 08:10
2^x mod n = 1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14658 Accepted Submission(s): 4527
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.
Print 2^? mod n = 1 otherwise.
You should replace x and n with specific numbers.
Sample Input
25
Sample Output
2^? mod 2 = 12^4 mod 5 = 1
Author
MA, Xiao
Source
ZOJ Monthly, February 2003
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 2462 2421 1695 2466 2447
无暴力,不解乏
#include<stdio.h>int main(){int n,k,m,x;while(scanf("%d",&n)!=EOF){k=1;x=2;if(n%2==0||n==1)printf("2^? mod %d = 1\n",n);else{ while(k++){x=x*2;x=x%n;if(x==1)break;}printf("2^%d mod %d = 1\n",k,n);} }}
0 0
- 杭电13952^x mod n = 1
- 杭电1395 2^x mod n = 1
- 杭电OJ 2^x mod n = 1
- 杭电 1395 2^x mod n = 1 暴力题
- 2^x mod n = 1 【杭电-HDOJ-1395】 附题
- 杭电 HDU ACM 1395 2^x mod n = 1
- 杭电ACM1395——2^x mod n = 1~~水题
- 数论 杭电 1395 2^x mod n = 1 暴力题
- 2^x mod n = 1
- ZOJ1489 2^x mod n = 1
- HDU1395:2^x mod n = 1
- zoj1489-2^x mod n = 1
- hdu1395-2^x mod n = 1
- hdu1395 2^x mod n = 1
- 1073:2^x mod n = 1
- HDU1395---2^x mod n = 1
- HDU 2^x mod n = 1
- hdu1395 2^x mod n = 1
- 倒排索引详解
- 路径问题
- getParameter() getAttribute() setAttribute()
- C/C++ 之 _splitpath 获取文件路径
- android studio设置debug.keystore
- 杭电13952^x mod n = 1
- 倒排索引详解
- Unity3d中所有特殊的文件夹
- 基于三层架构的员工管理系统
- 第9周项目1 - 猴子选大王(数组版)
- Mac osx 安装metasploit的教程(转译)
- Java一步一脚印—通过简单的TCP网络编程实现局域网的聊天对话
- jQuery之表单验证
- Android启动模式之lunchMode