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