Cod sursa(job #1195162)
Utilizator | Data | 6 iunie 2014 16:10:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
bool v[2000000];
int main()
{
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int n;
in >> n;
for (int i = 2; i * i <= n; i++){
if (! v[i]){
for (int j = i * i; j <= n; j += i)
v[j] = true;
}
}
int t = 0;
for (int i = 2; i < n; i++)
if(!v[i])
t++;
out << t;
return 0;
}