Cod sursa(job #652683)
Utilizator | Data | 25 decembrie 2011 20:29:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
bool a[2000001];
int i ,n, j, nr;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
a[0]=true;
a[1]=true;
for (i=1;i<=n;i++)
{
if (a[i]==false)
{
for (j=2;j<=n/i;j++) a[j*i]=true;
}
}
for (i=1;i<=n;i++) if (a[i]==false) nr++;
printf("%d",nr);
}