Cod sursa(job #3293131)
Utilizator | Data | 10 aprilie 2025 13:45:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bitset<2000001>ciur;
int main()
{
int n;
cin >> n;
for(int i=2;i*i<=n;i++)
if(ciur[i]==0)
for(int j=i*i;j<=n;j+=i)
ciur[j]=1;
int cnt=0;
for(int i=2;i<=n;i++)
if(ciur[i]==0)
cnt++;
cout << cnt;
return 0;
}