POJ-2191-Mersenne Composite Numbers
来源:互联网 发布:肯德基 网络市场调研 编辑:程序博客网 时间:2024/06/15 08:58
只能打表~没想到特别好的方法~
代码:
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int main(){ int s[10]={ 11, 23, 29, 37, 41, 43, 47, 53, 59 }; char st[10][100] ={ "23 * 89 = 2047 = ( 2 ^ 11 ) - 1", "47 * 178481 = 8388607 = ( 2 ^ 23 ) - 1", "233 * 1103 * 2089 = 536870911 = ( 2 ^ 29 ) - 1", "223 * 616318177 = 137438953471 = ( 2 ^ 37 ) - 1", "13367 * 164511353 = 2199023255551 = ( 2 ^ 41 ) - 1", "431 * 9719 * 2099863 = 8796093022207 = ( 2 ^ 43 ) - 1", "2351 * 4513 * 13264529 = 140737488355327 = ( 2 ^ 47 ) - 1", "6361 * 69431 * 20394401 = 9007199254740991 = ( 2 ^ 53 ) - 1", "179951 * 3203431780337 = 576460752303423487 = ( 2 ^ 59 ) - 1" }; int n; while(scanf("%d",&n)!=EOF) { for (int i=0;i<9;i++) if(s[i]<=n) printf("%s\n",st[i]); } return 0;}
- POJ-2191-Mersenne Composite Numbers
- POJ 2191 Mersenne Composite Numbers 整数分解
- poj 2191 Mersenne Composite Numbers 大数分解
- poj 2191 Mersenne Composite Numbers 筛法判素数
- POJ 2191 Mersenne Composite Numbers 解题报告(大数因式分解)
- HOJ 2022 Mersenne Composite Numbers
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N
- 1009. Mersenne Composite N
- Sicily.1009. Mersenne Composite N
- Sicily 1009. Mersenne Composite N
- sicily 1009.Mersenne Composite N
- sicily 1009. Mersenne Composite N
- Sicily 1009. Mersenne Composite N
- sicily 1009. Mersenne Composite N
- sicily 1009. Mersenne Composite N
- Kinect应用开发汇总
- mysql++ 中遇到的安装问题 及linux下C++添加共享库
- hdu 1176 免费馅饼 (数塔)
- linux内核分析笔记----虚拟文件系统(下)
- 算法入门经典-1
- POJ-2191-Mersenne Composite Numbers
- sky数
- ubuntu12.04samba服务器配置
- 话题模型(topic model)的提出及发展历史
- android4.2 锁屏源码分析
- MVC
- Context类详解
- 主题模型-LDA浅析
- spring security3 实现自定义管理权限