Cod sursa(job #2384711)
Utilizator | Data | 21 martie 2019 09:35:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
const int VM=200001;
bool c[VM];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n;
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;
}
}
}
in.close();
int nr=0;
for (int i=2;i<=n;i++)
{
if(!c[i])
{
nr++;
}
}
out << nr;
out.close();
return 0;
}