POJ1595_Prime Cuts【素数】【水题】
来源:互联网 发布:开源微信商城系统php 编辑:程序博客网 时间:2024/06/03 22:40
Prime Cuts
Time Limit: 1000MSMemory Limit: 10000K
Total Submissions: 10464Accepted: 3994
DescriptionA 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 2
18 2
18 18
100 7
Sample Output
21 2: 5 7 11
18 2: 3 5 7 11
18 18: 1 2 3 5 7 11 13 17
100 7: 13 17 19 23 29 31 37 41 43 47 53 59 61 67
Source
South Central USA 1996
题目大意:给你两个数N和C,算出1~N(包括N)之间的素数序列,
若素数个数为奇数,则输出素数序列中心的2*C-1个素数。
若素数个数为偶数,则输出素数序列中心的2*C个素数。
输出个数中说若C>素数个数,则输出整个素数序列。
思路:筛法求素数打表,之后求出素数序列的中心位置,判断奇偶并输出
注意:此题中,1被当做了质数(只限本题),数据规模开成1000是不够
的,需要开成1100,应该是测试数据超范围了。
- #include<stdio.h>
- int Prime[1100],PrimeNum[1100];
- int IsPrime()
- {
- for(int i = 1; i <= 1100; i++)
- Prime[i] = 1;
- for(int i = 2; i <= 1100; i++)
- {
- for(int j = i+i; j <= 1100; j+=i)
- Prime[j] = 0;
- }
- int num = 1;
- for(int i = 0; i <= 1100; i++)
- if(Prime[i])
- PrimeNum[num++] = i;
- return num;
- }
- int main()
- {
- int num = IsPrime();
- int N,C,pos;
- while(~scanf("%d%d",&N,&C))
- {
- pos = 0;
- for(int i = 1; i < num; i++)
- {
- if(N >= PrimeNum[i] && N < PrimeNum[i+1])
- {
- pos = i;
- break;
- }
- }
- printf("%d %d:",N,C);
- if(C > pos && pos%2==0)
- C = pos/2;
- else if(C > pos)
- C = (pos+1)/2;
- if(pos%2 == 1)
- {
- for(int i = (pos-(C*2-1))/2+1; i <= (pos-(C*2-1))/2+C*2-1; i++)
- printf(" %d",PrimeNum[i]);
- printf("\n\n");
- }
- else
- {
- for(int i = (pos-C*2)/2+1; i <= (pos-C*2)/2+C*2; i++)
- printf(" %d",PrimeNum[i]);
- printf("\n\n");
- }
- }
- return 0;
- }
0 0
- POJ1595_Prime Cuts【素数】【水题】
- POJ1595_Prime Cuts【素数】【水题】
- POJ 1095 Prime Cuts 素数
- HDU 1319 Prime Cuts(素数。。。)
- poj 1595 Prime Cuts(素数问题)
- HDU1319 Prime Cuts 【素数打表】
- poj1595 Prime Cuts (素数筛选)
- POJ 1595 Prime Cuts(素数切)
- hdu1319 Prime Cuts 水题
- POJ 1595 Prime Cuts 简单素数打表
- POJ 1595 Prime Cuts (ZOJ 1312) 素数打表
- hdu1319 Prime Cuts(数论:素数打表,不难但是恶心)
- POJ 1595(Prime Cuts) 素数筛法+模拟 Java
- poj Prime Cuts 1595 (素数打表 选择性素数输出)
- HDU-2134 Cuts the cake 水题 数学题
- 【HDU 2134】【水题】Cuts the cake
- Hust oj 1197 Cuts the cake(水题)
- prime cuts
- FOJ1504 Play Poker
- FOJ1341 Gopher II
- static 关键字 成员变量和静态变量的区别 静态使用的注意事项 静态代码块 构造代码块
- Oracle 在dos命令下导出导入
- 分布式监控系统ganglia配置文档
- POJ1595_Prime Cuts【素数】【水题】
- Thinkpad x60 Bios设置指南
- ssl双向验证
- 主函数!
- ubuntu jdk 安装与配置
- MATLAB 并行工具箱
- Python 处理遥感图像:光谱辐射定标、大气校正和计算反射率
- C++中的友元函数和友元类
- [数位dp] spoj 10738 Ra-One Numbers