来源:HDU2503
水题:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
using namespace std;
typedef long long LL;
int gcd(int a,int b){
if(b==0) return a;
else
return gcd(b,a%b);
}
int main(){
int T;
scanf("%d",&T);
while(T--){
int a,b,c,d;
scanf("%d%d%d%d",&a,&b,&c,&d);
int ddd,fff;
ddd=b*d;
fff=a*d+b*c;
int ggg=gcd(ddd,fff);
cout<<fff/ggg<<" "<<ddd/ggg<<endl;
}
return 0;
}