hdu 1395 2^x mod n = 1(暴力题)
来源:互联网 发布:北京全国接单淘宝贷款 编辑:程序博客网 时间:2024/06/05 09:33
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1395
2^x mod n = 1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12146 Accepted Submission(s): 3797
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
2
5
Sample Output
2^? mod 2 = 1
2^4 mod 5 = 1
题目大意:暴力搜索,找到合适的X值,这一题可以采取反过来暴力寻找,这一简单易懂些。
要注意的是输出的值时都要变化的,输出注意一下就好了,毕竟我是wa过的。。。
1 #include <iostream> 2 #include <cstdio> 3 using namespace std; 4 5 int main () 6 { 7 int n; 8 while (cin>>n) 9 {10 if (n%2&&n>1)11 {12 int s=1,x=1;13 while (x)14 {15 s=s*2%n;16 if (s==1)17 {18 printf ("2^%d mod %d = 1\n",x,n);19 break;20 }21 x++;22 }23 }24 else25 printf ("2^? mod %d = 1\n",n);26 }27 return 0;28 }
0 0
- hdu 1395 2^x mod n = 1(暴力题)
- hdu 1395 2^x mod n = 1 欧拉定理(当然可以直接暴力)
- HDU 1395 2^x mod n = 1(暴力枚举)
- hdu 1395 2^x mod n = 1 暴力过~~最好学下欧拉定理~~~
- hdoj 1395 2^x mod n = 1 【暴力】
- 杭电 1395 2^x mod n = 1 暴力题
- 数论 杭电 1395 2^x mod n = 1 暴力题
- HDU 2^x mod n = 1
- HDU 1395 2^x mod n = 1
- hdu 1395 2^x mod n = 1
- HDU 1395 2^x mod n = 1
- hdu 1395-2^x mod n = 1-易超时
- HDU 1395 2^x mod n = 1 数论
- HDU 1395 2^x mod n = 1
- hdu 1395 2^x mod n = 1
- hdu 1395 2^x mod n = 1
- HDU 1395 2^x mod n = 1
- HDU 1395 2^x mod n = 1
- hdu 2962 Trucking (二分+最短路Spfa)
- 如何在iOS中使用Block
- hdu 1690 Bus System(Dijkstra最短路)
- 反射机制
- hdu 1431 素数回文
- hdu 1395 2^x mod n = 1(暴力题)
- hdu 1102 Constructing Roads (最小生成树)
- hdu 1162 Eddy's picture(最小生成树算法)
- hdu 1875 畅通工程再续
- hdu 1230 火星A+B
- Android 项目(一):网络请求封装(一)
- hdu 1863 畅通工程 (并查集+最小生成树)
- KVO实现机制
- hdu 1213 How Many Tables(并查集算法)