Cod sursa(job #653205)
Utilizator | Data | 27 decembrie 2011 16:31:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
# include <stdio.h>
int i,j,nr,n;
bool prim[2000010];
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);
return 0;
}