Cod sursa(job #265311)
Utilizator | Data | 23 februarie 2009 19:34:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
#define NMAX 2000001
int n,viz[NMAX];
int main()
{
int i,j,contor=0;
viz[2]=0;
n=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
{
if(!viz[i])
{
contor++;
for(j=i*i;j<=n;j+=i)
viz[j]=1;
}
}
printf("%d",contor);
return 0;
}