HDOJ2503 ( a/b + c/d ) 【最大公约数GCD，最小公倍数LCM】

Problem : 2503 ( a/b + c/d )     Judge Status : Accepted
RunId : 5974062    Language : C++    Author : qq1203456195
Code Render Status : Rendered By HDOJ C++ Code Render Version 0.01 Beta

#include <cstdio>
#include <iostream>
using namespace std;
int gcd(int a,int b)
{
    int t,min,max;
    min=a<b?a:b;
    max=a<b?b:a;
    while (t=max%min,t!=0){    max=min;min=t;    }
    return min;
}
int lcm(int a,int b)
{
    int min,max,ret;
    min=a<b?a:b;
    max=a<b?b:a;
    ret=max;
    while (ret%min!=0)    ret+=max;
    return ret;
}
int main()
{
    int cas,a,b,c,d,f,e,g;
    scanf("%d",&cas);
    while (cas--)
    {
        scanf("%d%d%d%d",&a,&b,&c,&d);
        f=lcm(b,d);
        e=a*(f/b)+c*(f/d);
        g=gcd(e,f);
        printf("%d %d\n",e/g,f/g);
    }
    return 0;
}