Cod sursa(job #1653229)
Utilizator | Data | 15 martie 2016 20:18:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N, i, j, k;
bool v[1000000];
int main()
{
ifstream fin("ciur.in");
fin >> N;
fin.close();
k = 1; // N >= 2
for(i = 3; i<=N; i+=2)
{
if(v[(i-1)/2] == false)
{
++k;
for(j = i+i+i; j<=N; j += i+i)
v[(j-1)/2] = true;
}
}
ofstream fout("ciur.out");
fout << k;
fout.close();
return 0;
}