Cod sursa(job #922229)
Utilizator | Data | 21 martie 2013 23:20:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <cstdio>
using namespace std;
bool a[2000010];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,n,nr=0,j;
scanf("%d",&n);
for(i = 2; i <= n; i++)
a[i]=1;
for(i = 2; i <= n; i++)
if(a[i])
{
nr++;
for(j=i*2; j <= n; j+=i)
a[j]=0;
}
printf("%d",nr);
return 0;
}