Cod sursa(job #2369198)
Utilizator | Data | 5 martie 2019 21:40:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int n;
bool ok[2000100];
int ciur (int n) {
int prim = 0;
ok[0] = ok[1] = 1;
for (int i=0;i<=n;i++) {
if (ok[i]==0) {
prim++;
for (int j=2;i*j<=n;j++)
ok[i*j] = 1;
}
}
return prim;
}
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> n;
fout << ciur(n);
return 0;
}