Cod sursa(job #1040375)
| Utilizator | Data | 24 noiembrie 2013 14:34:11 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int V[2100000];
int main()
{
int i, j, n, k=0;
in >> n;
for (int i = 1; i <= n; i++)
V[i] = i;
for (i = 2; i <= n; i++)
{
if (V[i] == 0)
continue;
k++;
for (j = i * i; j <= n; j = j + i)
V[j] = 0;
}
out << k;
return 0;
}
