Cod sursa(job #2705328)
| Utilizator | Data | 12 februarie 2021 13:23:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
long long n,nrp,d,i,a,s;
int v[1000];
bool ok=1;
int main()
{
fin >> n;
for (i=2;i<=n;i++)
{
v[i]=i;
}
for (i=2;i<=n;i++)
{
for (d=2;d*d<=i;d++)
{
if (i%d==0)
{
ok=0;
}
}
if (ok)
{
nrp++;
for (a=2;a*i<=n;a++)
{
v[a*i]=0;
}
}
}
for (i=2;i<=n;i++)
{
if (v[i]!=0)
{
s++;
}
}
fout << s << endl;
}
