Cod sursa(job #622135)
Utilizator | Data | 17 octombrie 2011 14:39:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
bool c[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
long n,h=0,j;
int i;
scanf("%ld",&n);
for(i=2;i*i<=n;i++)
{
if(!c[i])
{
for(j=i*i;j<=n;j=j+i)
c[j]=true;
}
}
for (j=1;j<=n;j++)
if(!c[j])
h++;
h=h-1;
printf("%ld",h);
return 0;
}