Cod sursa(job #655457)
Utilizator | Data | 2 ianuarie 2012 17:15:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
int i,j,n,nr;
bool prim[2000005];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d\n",&n);
prim[1]=true;
nr=0;
for (i=2;i<=n;i++) {
if (prim[i]==false)
{
j=2;
while(i*j<=n)
{
prim[i*j]=true;
j++;
}
nr++;
}
}
printf("%d\n",nr);
fclose(stdin);
fclose(stdout);
return 0;
}