Cod sursa(job #2662142)
Utilizator | Data | 23 octombrie 2020 16:20:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int N = 2000010;
bitset<N> p;
int n,cnt;
int main()
{
f>>n;
if(n>=2)
cnt++;
int i;
for(i=3; i*i<=n; i+=2)
if(p[i]==0)
{
cnt++;
for(int j=i*i; j<=n; j+=i)
p[j]=1;
}
for(; i<=n; i+=2)
if(p[i]==0)
cnt++;
g<<cnt;
return 0;
}