Cod sursa(job #2635985)
Utilizator | Data | 16 iulie 2020 11:18:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000005];
int n, nr;
int main() {
fin >> n;
for(int i = 2; i <= n; i++)
if(!v[i]) {
nr++;
for(int j = 2; j*i <= n;j++)
v[j*i] = true;
}
fout << nr;
}