Cod sursa(job #641622)
Utilizator | Data | 28 noiembrie 2011 23:00:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
using namespace std;
int N,nr;
char sel[2000001];
int main()
{
int i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&N);
for(i=2;i<=N;++i)
sel[i]=1;
for (i=2;i<=N;++i)
{ if (sel[i])
nr++;
for (j=i+i;j<=N;j+=i)
sel[j]=0;
}
printf("%d",nr);
return 0;
}