Cod sursa(job #570169)
Utilizator | Data | 2 aprilie 2011 17:49:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
int main()
{int n,i,j,u,nr=0;
char a[2000005];
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
a[i]=i;
for(i=2;i<=n;i++)
{if(a[i]!=0)
{nr++;
for(j=i*2;j<=n;j+=i)
a[j]=0;
}
}
printf("%d",nr);
return 0;}