C - C
Crawling in process...
Crawling failed
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
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,
t
he 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
这道题没什么难的,就是注意素数的个分奇偶,看懂题意这道题就能AC
AC代码:
#include<iostream>
const int MAX=1001;
int s[MAX];
using namespace std;
int main()
{
int n,c,i,j,q,p,k;
int prime(int x);
while(cin>>n>>c)
{
j=0;
for(i=1;i<=n;i++)
{
if(prime(i))
{
s[j]=i;
j+=1;
}
}
if(j%2==0)
{
if((c*2-1)>=j)
{
cout<<n<<" "<<c<<":";
for(i=0;i<j;i++)
{
cout<<" "<<s[i];
}
cout<<endl;
cout<<endl;
}
else
{
cout<<n<<" "<<c<<":";
k=2*c;
while(k--)
{
cout<<" "<<s[j/2-c];
c-=1;
}
cout<<endl;
cout<<endl;
}
}
else
{
if((c*2-1)>=j)
{
cout<<n<<" "<<c<<":";
for(i=0;i<j;i++)
{
cout<<" "<<s[i];
}
cout<<endl;
cout<<endl;
}
else
{
cout<<n<<" "<<c<<":";
k=2*c-1;
while(k--)
{
cout<<" "<<s[j/2-(c-1)];
c-=1;
}
cout<<endl;
cout<<endl;
}
}
}
return 0;
}
int prime(int x)
{
int i;
for(i=2;i<x;i++)
{
if(x%i==0)
return 0;
}
return 1;
}