Cod sursa(job #463524)
Utilizator | Data | 16 iunie 2010 12:32:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
using namespace std;
#include<cstdio>
#define nmax 2000001
unsigned int n,i,j;
int a[nmax];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
if(!a[i])
for(j=i*i;j<=n;j=j+i) a[j]=1;
j=0;
for(i=2;i<=n;i++)
if(!a[i]) j++;
printf("%d\n",j);
return 0;
}