Cod sursa(job #2327872)
| Utilizator | Data | 25 ianuarie 2019 09:42:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
long long i,j,a[200005],N,contor=0;
for (i=2;i<=200005;++i)
{
a[i]=1;
}
a[1]=0;
for (i=2;i<=200005;++i)
{
if (a[i]==1)
{
for (j=i*i;j<=200005;j+=i)
{
a[j]=0;
}
}
}
fin >> N;
for (i=2;i<=N;++i)
{
if (a[i]==1)
{
++contor;
}
}
fout << contor;
return 0;
}
