poj 1595 Prime Cuts

大一刚搞的时候敲的

#include "stdio.h"
#include "stdlib.h"
#include "math.h"
int main()
{
    int i, j, c, prime[1000], b[1000], m, n, t, min, max;
    prime[0] = 1;
    memset(b, 0, sizeof(b));
    while (scanf("%d%d", &m, &n) != EOF)
    {
        c = 1;
        for (i = 2; i <= m; i++)
            if (!b[i])
            {
                prime[c++] = i;
                for (j = i*i; j <= m; j += i)
                    b[j] = 1;
            }
        t = (c) / 2;
        printf("%d %d:", m, n);
        if (t - n<0)
            min = 0;
        else
        {
            min = t - n;
            if (c % 2)
                min++;
        }
        if (t + n >= c)
            max = c;
        else

            max = t + n;


        for (j = min; j<max; j++)
            printf(" %d", prime[j]);
        printf("

");
    }
    return 0;
}