poj 3511 Fermat's Christmas Theorem 筛素数

//poj 3511
//sep9
#include <iostream>
using namespace std;
const int max_prime_num = 1000010;
const int max_n = 1000010; 
int primes[max_prime_num];
int vis[max_n],num;

void init()
{  
	memset(vis,0,sizeof(vis));  
	for(int i=2;i<max_n;++i){  
	    if(!vis[i])  
	        primes[num++]=i;  
	    for(int j=0;j<num&&i*primes[j]<max_n;++j){  
	        vis[i*primes[j]]=1;  
	        if(!i%primes[j])  
	        	break;  
	    }  
	}
}

int main()
{
	init();
	int l,r;
	while(scanf("%d%d",&l,&r)==2){
		if(l==-1&&r==-1)
			break;
		int x=0,y=0;
		for(int i=0;i<num;++i){
			if(primes[i]>r) 
				break;
			if(primes[i]>=l){
				++x;
				if(primes[i]==2||(primes[i]-1)%4==0)
					++y;
			}
		}
		printf("%d %d %d %d\n",l,r,x,y);
	}
	return 0;	
}