Cod sursa(job #2639462)
Utilizator | Data | 2 august 2020 11:43:40 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
using namespace std;
int GCD(int A, int B)
{
if(B == 0)
return A;
return GCD(B, A%B);
}
int main()
{
int contor = 0;
int N;
cout << "N=";
cin >> N;
for( int i = 1 ; i <= N ; i++)
for( int j = 1 ; j <= N ; j++)
{
int cmmdc = GCD(i,j);
if(cmmdc == 1)
{
contor++;
cout<< i <<"/" << j<< endl;
}
}
cout << contor;
return 0;
}