Cod sursa(job #2188819)
Utilizator | Data | 27 martie 2018 15:03:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 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()
{
long long n,num=0;
f>>n;
while(n>1)
{
if(prim(n))
num++;
n=n-1;
}
g<<num;
}