Cod sursa(job #247154)
Utilizator | Data | 22 ianuarie 2009 10:59:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
#define N 2000005
int nr;
bool a[N];
void rezolvare()
{
int i,j,n;
scanf("%d",&n);
for (i=2;i<=n;++i)
if (!a[i])
{
++nr;
for (j=i+i;j<=n;j+=i)
a[j]=true;
}
printf("%d",nr);
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
rezolvare();
return 0;
}