Cod sursa(job #2520126)
Utilizator | Data | 8 ianuarie 2020 23:16:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int nr, n;
bool p[200005];
int prim2()
{
for (int i = 3; i <= n; i += 2) {
if (p[i] == 0) {
nr++;
for (int j = i + i + i; j <= n; j += i * 2 ){
p[j] = 1;
}
}
}
return nr+1;
}
int main()
{
fin >> n;
fout<<prim2();
}