函式實現

// greatest common divisor (最大公約數)
int GCD (int a, int b)
{
    if(b==0)
        return a;
    else
        return GCD(b,a%b);
}

函式用途

可用來化簡分數為最簡分數

 程式碼實現

#include<iostream>
using namespace std;
// 求最大公約數的函式說明
int GCD(int a, int b)
{
	if (b == 0)
		return a;
	else
		return GCD(b, a%b);
}
int main()
{
	int m, n, divisor;
	cin >> m >> n;
	divisor = GCD(m, n);
	cout << m << "/" << n << "=" << m / divisor << "/" << n/divisor << endl;
	return 0;
}