Cod sursa(job #3038568)
Utilizator | Data | 27 martie 2023 15:45:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
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, cnt=0;
bitset <2500010>ciur;
int main()
{
fin>>n;
for(int i=2; i<=n; i++) {
if(ciur[i]==0) {
cnt++;
if(i*i<=n)
for(int j=i*i; j<=n; j+=i) ciur[j]=1;
}
}
fout<<cnt;
return 0;
}