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