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