POJ - 1595 《Prime Cuts》
来源:互联网 发布:起点作者写作软件 编辑:程序博客网 时间:2024/06/06 12:33
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.
Sample Input
21 218 218 18100 7
Sample Output
21 2: 5 7 1118 2: 3 5 7 1118 18: 1 2 3 5 7 11 13 17100 7: 13 17 19 23 29 31 37 41 43 47 53 59 61 67
【实现代码】
#include<cstdio>#define maxn 100005bool IsPrime[maxn];int Prime[maxn];void Init(int n){ IsPrime[1]=1; IsPrime[2]=1; for(int i=3;i<=n;i++)IsPrime[i]=i%2; for(int i=3;i*i<=n;i+=2) { if(IsPrime[i]) { for(int j=2;j*i<=n;j++) { IsPrime[j*i]=0; } } }}int main(){ int n,c; while(scanf("%d%d",&n,&c)!=EOF) { Init(n); int j=0; for(int i=1;i<=n;i++)if(IsPrime[i])Prime[++j]=i; printf("%d %d:",n,c); int x=j/2-c+1; if(j%2!=0)x+=1; if(x<1)x=1; for(int i=x;i<j/2+c+1&&i<=j;i++)printf(" %d",Prime[i]); printf("\n\n"); } return 0;}
- poj 1595 Prime Cuts
- POJ - 1595 《Prime Cuts》
- POJ-1595-Prime Cuts
- POJ 1595 Prime Cuts
- poj 1595 Prime Cuts
- POJ 1595 Prime Cuts
- POJ 1595 -- Prime Cuts
- POJ 1595Prime Cuts
- POJ 1595 Prime Cuts 未完成
- POJ 1595 Prime Cuts 笔记
- zoj 1312 || poj 1595 Prime Cuts
- poj 1595 zoj 1312 Prime Cuts
- poj 1595 Prime Cuts(素数问题)
- POJ 1595 Prime Cuts(素数切)
- POJ 1095 Prime Cuts 素数
- POJ 1595 Prime Cuts 简单素数打表
- POJ 1595 Prime Cuts (ZOJ 1312) 素数打表
- Prime Cuts http://poj.org/problem?id=1595
- 待读笔记[1]
- VS2008或者VS2010出现devenv.exe 系统错误
- HDU 多校联合练习赛2 Warm up 2 二分图匹配
- oracle数据库的下载及安装
- hdu1015(Safecracker )
- POJ - 1595 《Prime Cuts》
- GCC选项_-Wl,-soname
- JQuery ajax
- exploit/windows/smb/ms08_067_netapi
- jquery常用方法
- Oracle—RMAN备份(一)
- Servlet 实现上传附件(支持多附件)
- 黑马程序员—SQL系列 (二)
- 均值(Mean)和均值标准误差(S.E. Mean)