Cod sursa(job #204464)
Utilizator | Data | 24 august 2008 13:47:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
#define NMAX 2000000
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
long i,n,nrp=0,p,d,j,x,y;
char c[NMAX+1]={0};
scanf("%ld",&n);
for(i=2;i<=n/2;i++)
if(c[i]==0)
{
for(j=i;i*j<=n;j++)
c[i*j]=1;
}
for(i=2;i<=n;i++)
if(c[i]==0) nrp++;
printf("%ld",nrp);
return 0;
}