Cod sursa(job #2363749)
Utilizator | Data | 3 martie 2019 16:34:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <bitset>
#define nmax 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,s=1;
bitset<nmax+5> ciur;
int main()
{
fin>>n;
for(int i=3;i*i<=n;i++)
if(!ciur[i])
for(int j=i+i;j<=n;j+=i)
ciur[j]=1;
for(int i=3;i<=n;i+=2)
if(!ciur[i])
s++;
fout<<s;
return 0;
}