POj 3511 Fermat’s Chirstmas Theorem

E - Fermat’s Chirstmas Theorem

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  SDUTOJ 2093

Description

In a letter dated December 25, 1640; the great mathematician Pierre de Fermat wrote to Marin Mersenne that he just proved that an odd prime p is expressible as p = a2 + b2 if and only if p is expressible as p = 4c + 1. As usual, Fermat didn’t include the proof, and as far as we know, never

wrote it down. It wasn’t until 100 years later that no one other than Euler proved this theorem.

Input

Your program will be tested on one or more test cases. Each test case is specified on a separate input line that specifies two integers L, U where L ≤ U < 1, 000, 000

The last line of the input file includes a dummy test case with both L = U = −1.

Output

L U x y

where L and U are as specified in the input. x is the total number of primes within the interval [L, U ] (inclusive,) and y is the total number of primes (also within [L, U ]) that can be expressed as a sum of squares.

Sample Input

10 20
11 19
100 1000
-1 -1

Sample Output

10 20 4 2
11 19 4 2
100 1000 143 69

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
const int MAXN = 1000011;
bool flag[MAXN];
int primes[MAXN], pi;

void sai()
{
    int i, j;
    pi = 0;
    memset(flag, false, sizeof(flag));
    flag[1] = 1;
    for (i = 2; i < MAXN; i++)
    {
        if (!flag[i])
            primes[pi++] = i;
        for (j = 0; (j < pi)  && (i * primes[j] < MAXN); j++)
        {
            flag[i * primes[j]] = true;
            if (i % primes[j] == 0)
                break;
        }
    }
}

int main()
{
    sai();
    int i;
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n == -1 && m == -1)
        {
            break;
        }
        int count = 0,sum = 0;
        for(i=0;i<=m;i++)
        {
            if(primes[i]>=n && primes[i]<=m)
            {
                count++;
                if(primes[i]%4 == 1)
                {
                    sum++;
                }
            }
            else if(primes[i]>m)
            {
                break;
            }
        }

        
        if(n<=2 && m>=2)
        {
            sum++;
        }
        printf("%d %d %d %d\n",n,m,count,sum);
    }
    return 0;
}