[暑假集训--数论]poj1595 Prime Cuts

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 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

问数字范围在 l 到 r 内的数中，大小排最中间的2k-1或者2k个是哪些

暴力

 #include<cstdio>
 #include<iostream>
 #include<cstring>
 #define LL long long
 using namespace std;
 inline LL read()
 {
     LL x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 int n,m;
 bool mk[];
 int p[],len;
 int rnk[];
 inline void getp()
 {
     p[++len]=;rnk[]=;
     for (int i=;i<=;i++)
     {
         if (!mk[i])
         {
             p[++len]=i;
             rnk[i]=len;
             for (int j=*i;j<=;j+=i)mk[j]=;
         }
     }
 }
 int main()
 {
     getp();
     while (~scanf("%d%d",&n,&m))
     {
         if (n<=)continue;
         printf("%d %d:",n,m);
         while (mk[n])n--;
         int ls=rnk[n],l,r;
         if (ls&)l=max(ls/+-m+,),r=min(ls/++m-,ls);
         else l=max(ls/-m+,),r=min(ls/+m,ls);
         for (int i=l;i<=r;i++)
         {
             printf(" %d",p[i]);
         }
         puts("\n");
     }
 }

poj 1595