Cod sursa(job #3284834)
Utilizator | Data | 12 martie 2025 11:17:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream fcin("ciur.in");
ofstream fout("ciur.out");
int n, ctr;
bitset <2000001>v;
int main()
{
fcin>>n;
v.set(0);
v.set(1);
for(int i=2; i<=n; i++)
{
if (v.test(i)==0)
{
ctr++;
for(int j=i+i; j<=n; j+=i)
v.set(j);
}
}
fout<<ctr;
}