Cod sursa(job #259980)
Utilizator | Data | 16 februarie 2009 11:43:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
#define N 2000008
int c[N];
int n;
void ciur()
{
int i,j;
for(i=2;i*i<=n;++i)
if(c[i]==0)
for(j=i*i;j<=n;j+=i)
c[j]=1;
}
int main()
{
int count=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
ciur();
for(int i=2;i<=n;++i)
if(c[i]==0)
count++;
printf("%d",count);
return 0;
}