HDU1164_Eddy's research I【Miller Rabin素数测试】【Pollar Rho整数分解】
2015-09-28 12:17
369 查看
Eddy's research I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6664 Accepted Submission(s): 3997
Problem Description
Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't write program, so Eddy has to ask intelligent you to help him, he asks you to write
a program which can do the number to divided into the multiply of prime number factor .
Input
The input will contain a number 1 < x<= 65535 per line representing the number of elements of the set.
Output
You have to print a line in the output for each entry with the answer to the previous question.
Sample Input
11
9412
Sample Output
11
2*2*13*181
Author
eddy
题目大意:随意一个数x,都能够被分解为几个素数(能够同样)相乘的形式。如今给你一个数x,
把它分解为几个素数相乘的形式。
思路:这里x的规模最大为65535。所以用简单的素性推断方法直接暴力也能够过。网上贴的
代码大多简单,这里贴一个用【Miller Rabin素数測试】+【Pollar Rho整数分解】来做的代码
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6664 Accepted Submission(s): 3997
Problem Description
Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't write program, so Eddy has to ask intelligent you to help him, he asks you to write
a program which can do the number to divided into the multiply of prime number factor .
Input
The input will contain a number 1 < x<= 65535 per line representing the number of elements of the set.
Output
You have to print a line in the output for each entry with the answer to the previous question.
Sample Input
11
9412
Sample Output
11
2*2*13*181
Author
eddy
题目大意:随意一个数x,都能够被分解为几个素数(能够同样)相乘的形式。如今给你一个数x,
把它分解为几个素数相乘的形式。
思路:这里x的规模最大为65535。所以用简单的素性推断方法直接暴力也能够过。网上贴的
代码大多简单,这里贴一个用【Miller Rabin素数測试】+【Pollar Rho整数分解】来做的代码
#include<stdio.h> #include<stdlib.h> #include<time.h> #include<math.h> #include<algorithm> using namespace std; #define MAX_VAL (pow(2.0,60)) //miller_rabbin素性測试 __int64 mod_mul(__int64 x,__int64 y,__int64 mo) { __int64 t,T,a,b,c,d,e,f,g,h,v,ans; T = (__int64)(sqrt(double(mo)+0.5)); t = T*T - mo; a = x / T; b = x % T; c = y / T; d = y % T; e = a*c / T; f = a*c % T; v = ((a*d+b*c)%mo + e*t) % mo; g = v / T; h = v % T; ans = (((f+g)*t%mo + b*d)% mo + h*T)%mo; while(ans < 0) ans += mo; return ans; } __int64 mod_exp(__int64 num,__int64 t,__int64 mo) { __int64 ret = 1, temp = num % mo; for(; t; t >>=1,temp=mod_mul(temp,temp,mo)) if(t & 1) ret = mod_mul(ret,temp,mo); return ret; } bool miller_rabbin(__int64 n) { if(n == 2) return true; if(n < 2 || !(n&1)) return false; int t = 0; __int64 a,x,y,u = n-1; while((u & 1) == 0) { t++; u >>= 1; } for(int i = 0; i < 50; i++) { a = rand() % (n-1)+1; x = mod_exp(a,u,n); for(int j = 0; j < t; j++) { y = mod_mul(x,x,n); if(y == 1 && x != 1 && x != n-1) return false; x = y; } if(x != 1) return false; } return true; } //PollarRho大整数因子分解 __int64 minFactor; __int64 gcd(__int64 a,__int64 b) { if(b == 0) return a; return gcd(b, a % b); } __int64 PollarRho(__int64 n, int c) { int i = 1; srand(time(NULL)); __int64 x = rand() % n; __int64 y = x; int k = 2; while(true) { i++; x = (mod_exp(x,2,n) + c) % n; __int64 d = gcd(y-x,n); if(1 < d && d < n) return d; if(y == x) return n; if(i == k) { y = x; k *= 2; } } } __int64 ans[1100],cnt; void getSmallest(__int64 n, int c) { if(n == 1) return; if(miller_rabbin(n)) { ans[cnt++] = n; return; } __int64 val = n; while(val == n) val = PollarRho(n,c--); getSmallest(val,c); getSmallest(n/val,c); } int main() { __int64 X; while(~scanf("%I64d",&X)) { cnt = 0; getSmallest(X,200); sort(ans, ans+cnt); for(int i = 0; i < cnt; i++) { if(i!=0) printf("*%I64d",ans[i]); else printf("%I64d",ans[i]); } printf("\n"); } return 0; }
相关文章推荐
- 万能适配器
- Android Studio在SVN上创建分支
- 移动构造-C++11
- Jetty9.3 翻译
- Spring context:component-scan代替context:annotation-config
- 基于spring,Atomikos,mybatis的分布式动态数据源JTA实现
- iOS Xcode错误: linker command failed with exit code 1 (use -v to see invocation) 可能错误与处理方法
- 技术面试(操作系统)
- 推荐!国外程序员整理的Java资源大全
- MySQL InnoDB MVCC实现原理
- java设计模式之外观模式
- javascript内存泄漏总结
- QJSON的编译方法
- Android于JNI调用列出的程序
- android四大组件之ContentProvider个人总结
- CYC-数据解析3 - 加载图片
- 寻找神格
- xcode6 插件制作
- codeforces 580D(状态dp)
- windows下面安装Python和pip教程