Cod sursa(job #2449839)
| Utilizator | Data | 20 august 2019 20:32:45 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,nr;
const int Nmax=2000005;
int v[Nmax];
int main()
{
fin>>n;
for(int i=2;i<=n;i++)
{
if(!v[i])
{
for(int j=i+i;j<=n;j+=i)
{
v[j]=1;
}
}
}
for(int i=2;i<=n;i++)
{
if(!v[i])
{
++nr;
}
}
fout<<nr;
return 0;
}
