Cod sursa(job #779571)
Utilizator | Data | 18 august 2012 01:05:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool ciur[2000005];
long long n;
void ciurExecute(int k)
{
for (int i = 2 * k; i <= n; i += k)
ciur[i] = false;
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in >> n;
for (int i = 0; i <= n; i++)
ciur[i] = true;
int count = 0;
for (int i = 2; i <= n; i++)
if (ciur[i])
count++, ciurExecute(i);
out << count;
return 0;
}