两个分数的最大公约数和最小公倍数

传送门

#include<cstdio>
#include<iostream>
using namespace std;
typedef long long ll;
int t;
ll m,n,x,y;
ll gcd(ll a,ll b){
	return b>0?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
	return a*b/gcd(a,b);
}
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%lld%lld%lld%lld",&m,&n,&x,&y);
		int p=gcd(m,n);
		m/=p;n/=p;//注意m与n除得是p
		p=gcd(x,y);
		x/=p;y/=p;//注意
		printf("%lld/%lld %lld/%lld\n",gcd(m,x),lcm(n,y),lcm(m,x),gcd(n,y));
	}
	return 0;
}