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