Cod sursa(job #2398935)
| Utilizator | Data | 6 aprilie 2019 14:27:45 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
//ciurul lui erasthothenes
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
constexpr long long NX {2000010};
bool nr[NX];
int main()
{
long long n;
fin>>n;
for(int i=2; i<=n; ++i)
nr[i]=1;
int s{};
for(int i=2; i<=n; ++i)
{
if(nr[i])
{
s++;
for(int j=i+i; j<=n; j+=i)
nr[j]=0;
}
}
fout<<s;
return 0;
}
