Cod sursa(job #913738)
Utilizator | Data | 13 martie 2013 19:03:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
int v[2000001],n,i,k,j;
int main()
{
freopen("ciur.in","rt",stdin);
freopen("ciur.out","wt",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
{
v[i]=0;
}
k=0;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
k++;
for(j=i+i;j<=n;j=j+i)
{
v[j]=1;
}
}
}
printf("%d",k);
fclose(stdout);
return 0;
}