HDU2503 a/b + c/d[入门+辗转相除]

辗转相除求最大公约数！

/* HDU2503 a/b + c/d */
 
#include <iostream>
 
using namespace std;
 
// 非递归计算最大公约数
int gcd(int m, int n)
{
    for(;;) {
        if(n == 0)
            return m;
        int temp = m % n;
        m = n;
        n = temp;
    }
}
 
int main()
{
    int t, a, b, c, d;
    int numerator, decimal, gcdval;
 
    cin >> t;
    while(t--) {
        cin >> a >> b >> c >> d;
 
        numerator = a * d + b * c;
        decimal = b * d;
 
        gcdval = gcd(numerator, decimal);
 
        cout << numerator / gcdval << " " << decimal / gcdval << endl;
    }
 
    return 0;
}