Cod sursa(job #324825)
Utilizator | Data | 17 iunie 2009 16:11:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
long n,i,j,t;
char c[2000000005];
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; t--;}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
t=n;
ciur();
printf("%ld\n",t);
return 0;
}