Cod sursa(job #247153)
Utilizator | Data | 22 ianuarie 2009 10:56:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 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)
for (j=i+i;j<=n;j+=i)
a[j]=true;
for(i=2;i<=n;++i)
if (a[i]==false)
++nr;
printf("%d",nr);
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
rezolvare();
return 0;
}