Cod sursa(job #392995)
| Utilizator |  Dan Alexandru dan_10 |
Data | 8 februarie 2010 18:32:33 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
long n,t[2000005],i,k;
int main()
{ freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
for(i=2;i<=n;i++)
if(t[i]==0)
{ k++;
for(long j=i+1;j<=n;j++)
if(j%i==0) t[j]=1;
}
printf("%ld",k);
fclose(stdin);
fclose(stdout);
return 0;
}