Cod sursa(job #2020936)
Utilizator | Data | 12 septembrie 2017 11:44:16 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int divizor(int a,int b)
{
if(b==0)
return a;
return divizor(b,a%b);
}
int f(int k)
{
int s=0;
for(int i=1;i<=k;i++)
for(int j=i;j<=k;j++)
if(divizor(i,j)==1)
s++;
return 2*s-1;
}
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int k;
in>>k;
out<<f(k);
}