Cod sursa(job #2569213)
Utilizator | Data | 4 martie 2020 11:32:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
const int NMAX=2e6+5;
int n,k;
bitset <NMAX> F;
int main()
{
fi>>n;
k=1;
for(int i=3;i<=n;i=i+2)
if(!F[i])
{
k++;
for(int j=i+i+i;j<=n;j+=2*i)
F[j]=1;
}
fo<<k<<"\n";
fi.close();
fo.close();
return 0;
}