Cod sursa(job #2220682)
Utilizator | Data | 12 iulie 2018 12:50:42 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f ("fractii.in");
ofstream g ("fractii.out");
int n;
int divizor (int a, int b)
{
if(b == 0)
return a;
else return divizor (b, a % b);
}
int main()
{int i,j,c,a1,b1;
f>>n;
c=1;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){if(i!=j){a1=i;b1=j;
if (divizor(a1,b1)==1) c++;
}}
g<<c;
return 0;
}