Cod sursa(job #752061)
Utilizator | Data | 27 mai 2012 18:13:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
using namespace std;
int a[2000005];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%d", &n);
int i,j,nr=0;
for(i=2; i<=n; i++)
a[i] = 0;
for(i=2; i<=n; i++)
if(a[i] == 0)
{
nr++;
for(j=i+i; j<=n; j+=i)
a[j] = 1;
}
printf("%d\n", nr);
return 0;
}