Cod sursa(job #2862040)
| Utilizator | Data | 4 martie 2022 20:22:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bitset <2000001> ciur;
int cnt=1;
void ciur_ (int n)
{
ciur[0]=ciur[1]=1;
ciur[2]=0;
for (int i=4; i<=n; i+=2)
ciur[i]=1;
for (int i=3; i*i<=n; i+=2)
if (ciur[i]==0)
for (int j=i*i; j<=n; j+=2*i)
ciur[j]=1;
for (int i=3; i<=n; i+=2)
if (ciur[i]==0)
cnt++;
}
int n;
int main()
{
cin>>n;
ciur_(n);
cout<<cnt;
}
