Cod sursa(job #3283501)
Utilizator | Data | 9 martie 2025 18:24:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
int cnt;
bitset<2000003> a;
int main()
{
fin>>n;
for (int i=2;i<=n;i++)
{
if (a[i]==0)
{
cnt++;
for (int j=2*i;j<=n;j+=i)
a[j]=1;
}
}
fout<<cnt;
return 0;
}