Cod sursa(job #2931880)
Utilizator | Data | 1 noiembrie 2022 09:43:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n, sol=0;
in >> n;
bitset<2000000> v;
for(int i=2; i<n; i++)
{
if(v[i]==0)
{
for(int j=i*2; j<n; j+=i) v[j]=1;
sol++;
}
}
out << sol;
return 0;
}