Cod sursa(job #3146704)
Utilizator | Data | 22 august 2023 11:39:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int N = 2000001;
int n,sol;
bitset<N> p;
int main()
{
f>>n;
sol=1;
int i;
for(i=3; i*i<=n; i+=2)
if(p[i]==0)
{
sol++;
for(int j=i*i; j<=n; j+=i)
p[j]=1;
}
for( ;i<=n;i+=2)
if(p[i]==0)
sol++;
g<<sol<<'\n';
return 0;
}