Cod sursa(job #2188812)
Utilizator | Data | 27 martie 2018 14:53:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prim(int a)
{
if(a<2)
return false;
if(a==2)
return true;
for(int i=2; i<=a/2; i++)
if(a%i==0)
return false;
return true;
}
int main()
{
int num=0;
long long n;
f>>n;
for(int i=1; i<=n; i++)
{
if(prim(i))
num++;
}
g<<num;
}