Cod sursa(job #2360158)
Utilizator | Data | 1 martie 2019 13:26:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bitset <2000002> viz;
int n;
int main()
{
fin>>n;
int c=1;
for (int i=3;i<=n;i+=2)
if (viz[i]==0)
for (int j=i*i;j<=n;j+=i)
viz[j]=1;
for (int i=3;i<=n;i+=2)
if (viz[i]==0)
c++;
fout<<c;
return 0;
}