Cod sursa(job #2537173)
Utilizator | Data | 3 februarie 2020 10:52:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ciur[2000000];
int main()
{
int n, nr;
f >> n;
nr = 1;
for(int i = 3; i <= n; i += 2)
{
if(ciur[i] == 0)
{
nr++;
for(int j = 2 * i; j <= n; j += i)
ciur[j] = 1;
}
}
g << nr;
return 0;
}