Cod sursa(job #2561329)
| Utilizator | Data | 28 februarie 2020 18:49:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,sol;
bool vp[2000005];
void citire()
{
f>>n;
}
void ciur(int n)
{
vp[1]=1;
for(int i=2;i<=n;i++)
{
if(vp[i]==0)
for(int j=i+i;j<=n;j=j+i)
vp[j]=1;
}
}
bool prim(int nr)
{
if(vp[nr]==1)
return 0;
return 1;
}
void solve()
{
ciur(n);
for(int i=2;i<=n;i++)
{
if(prim(i)==true)
sol++;
}
}
void afisare()
{
g<<sol;
}
int main()
{
citire();
solve();
afisare();
return 0;
}
