poj1595-Prime Cuts
来源:互联网 发布:ubuntu给予文件夹权限 编辑:程序博客网 时间:2024/06/05 07:20
poj1595-Prime Cuts(筛法求素数)
Prime Cuts
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 11684
Accepted: 4449
Description
A prime number is a counting number (1, 2, 3, …) that is evenly divisible only by 1 and itself. In this problem you are to write a program that will cut some number of prime numbers from the list of prime numbers between (and including) 1 and N. Your program will read in a number N; determine the list of prime numbers between 1 and N; and print the C*2 prime numbers from the center of the list if there are an even number of prime numbers or (C*2)-1 prime numbers from the center of the list if there are an odd number of prime numbers in the list.
Input
Each input set will be on a line by itself and will consist of 2 numbers. The first number (1 <= N <= 1000) is the maximum number in the complete list of prime numbers between 1 and N. The second number (1 <= C <= N) defines the C*2 prime numbers to be printed from the center of the list if the length of the list is even; or the (C*2)-1 numbers to be printed from the center of the list if the length of the list is odd.
Output
For each input set, you should print the number N beginning in column 1 followed by a space, then by the number C, then by a colon (:), and then by the center numbers from the list of prime numbers as defined above. If the size of the center list exceeds the limits of the list of prime numbers between 1 and N, the list of prime numbers between 1 and N (inclusive) should be printed. Each number from the center of the list should be preceded by exactly one blank. Each line of output should be followed by a blank line. Hence, your output should follow the exact format shown in the sample output.
简单素数筛
法1:O(nlogn)bool valid[MAXN];int ans[MAXN];int main(){ int n = 100, tot = 0; memset(valid, 1, sizeof(valid)); for (int i = 2; i <= n; i++) { if (valid[i]) ans[++tot] = i; for (int j = 1; (j<=tot) && (i*ans[j]<=n); j++) { cout<<"i="<<i<<" ans[j] = "<<ans[j]<<endl; valid[i*ans[j]] = false; if (i % ans[j] == 0) break; } } for (int i = 1; i <= tot; i++) cout<<ans[i]<<" "; return 0;} 法2:O(n)int main(){ int n = 100, tot = 0; memset(valid, 1, sizeof(valid)); for (int i = 2; i <= n; i++){ if (!valid[i]) continue; if (n / i < i) break; for (int j = i*i; j <= n; j = j+i) valid[j] = false; } for (int i = 2; i <= n; i++) if (valid[i]) cout<<i<<" "; return 0;}
这道题:
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int MAXN = 2000;int ans[MAXN], tot;bool valid[MAXN];void getPrim(int n){ memset(valid, 1, sizeof(valid)); ans[++tot] = 1; for (int i = 2; i <= n; i++){ if (valid[i]) ans[++tot] = i; for (int j = 2; (j<=tot&&i*ans[j]<=n); j++){ valid[i*ans[j]] = 0; if (i % ans[j] == 0) break; } }}int main(){ freopen("in.txt", "r", stdin); int n, c; while (~scanf("%d%d", &n, &c)) { printf("%d %d: ", n, c); tot = 0; getPrim(n); if (tot & 1) { int mid = tot / 2 + 1; for (int i = max(mid - c + 1, 1); i <= min(mid + c - 1, tot); i++) printf("%d ", ans[i]); } else { int mid = tot / 2; for (int i = max(mid - c + 1, 1); i <= min(mid + c, tot); i++) printf("%d ", ans[i]); } printf("\n\n"); } return 0;}
- 【筛法打表】poj1595 Prime Cuts
- Prime Cuts(poj1595)
- poj1595-Prime Cuts
- POJ1595 Prime Cuts [暴力打表]
- poj1595 prime cuts(快速筛选)
- poj1595 Prime Cuts (素数筛选)
- prime cuts
- Prime Cuts
- Prime Cuts
- zoj1312 Prime Cuts
- fjnu 1848 Prime Cuts
- JOJ1148:Prime Cuts
- HDU 1319 Prime Cuts
- poj 1595 Prime Cuts
- HDU1319 & PKU3518 - Prime Cuts
- HOJ 1107 Prime Cuts
- Uva 406 - Prime Cuts
- hdu1319 Prime Cuts
- C++ MFC / VS2013 之四 对话框:(创建对话框模板和修改对话框属性)
- Linux Shell高级技巧(一)
- 附加数据库失败,操作系统错误 5:"5(拒绝访问。)"的解决办法
- Recording_linux c++下 try catch用法
- 《C++ Primer Plus》ch08笔记
- poj1595-Prime Cuts
- 正则表达式学习笔记3-练习
- C++11启动线程的多种方式
- 学习笔记之观察者模式
- Linux 在一个命令行上执行多个命令
- 自由幻想UI之技能面板
- 集合框架之List
- 数据库——事务
- ios测试流程