Cod sursa(job #2662791)
Utilizator | Data | 24 octombrie 2020 15:06:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool w[2000005];
int n, i, j, nr;
int main()
{
f >> n;
w[1] = w[0] = true;
for(i = 2; i <= n; ++ i)
if(w[i] == false)
{
nr ++;
for(j = i + i; j <= n; j += i)
w[j] = true;
}
g << nr << "\n";
return 0;
}