Cod sursa(job #204347)
| Utilizator | Data | 23 august 2008 07:28:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
#define NMAX 2000000
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,j,nrp,p,d;
char v[NMAX+1]={0};
scanf("%d",&n);
for(i=2;i*i<=n;i++)
if(!v[i])
for(j=2;j*i<=n;j++) v[j*i]=1;
nrp=0;
for(i=2;i<=n;i++)
if(!v[i]) nrp++;
printf("%d",nrp);
return 0;
}
