Cod sursa(job #2384706)
Utilizator | Data | 21 martie 2019 09:31:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
const int VM=2000001;
bool c[VM];
int main()
{
int n,nr=0;
in>>n;
for(int i=2; i*i<=n; i++)
{
if(!c[i])
{
for(int j=i*i; j<=n; j+=i)
{
c[j]=true;
}
}
}
for(int i=2;i<=n;i++)
if(!c[i])
nr++;
out<<nr;
return 0;
}