Cod sursa(job #569522)
Utilizator | Data | 1 aprilie 2011 17:14:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<cstdio>
#include <stdio.h>
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,j,prim[1000000],n,c=0;
scanf("%d",&n);
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i])
{
c++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
printf("%d",c);
return 0;
}