Cod sursa(job #324830)
Utilizator | Data | 17 iunie 2009 16:20:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
long n,i,j,t;
char c[2000005];
void ciur()
{
long i;
for(i=2;i*i<=n;++i)
if(!c[i])
for(j=i+i;j<=n;j=j+i) c[j]=1;
for(i=2;i<=n;++i)
{
if(!c[i])
{
t++;
}
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
ciur();
printf("%ld\n",t);
return 0;
}