Cod sursa(job #2422632)
Utilizator | Data | 19 mai 2019 14:03:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
int n, i, j, nr;
bitset <2000001> w;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f >> n;
for(i = 2; i <= n; i ++)
if(w[i] == false)
{
nr ++;
for(j = i * i; j <= n; j += i)
w[j] = true;
}
g << nr;
f.close();
g.close();
return 0;
}