Cod sursa(job #714383)
Utilizator | Data | 15 martie 2012 18:20:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
#define nMax 2000001
using namespace std;
bool a[nMax];
int n;
int s;
int main()
{
freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
scanf ("%d", &n);
for (int i = 2; i <= n; ++ i){
if (!a[i]){
++ s;
for (int j = i + i; j <= n; j += i){
a[j] = 1;
}
}
}
printf ("%d\n", s);
return 0;
}