此题不水,谁与争锋!
代码如下:
#include <stdio.h>
int gcd(int m, int n)
{
int middle;
if(m > n)
{
middle = gcd(m - n, n);
}
if(m < n)
{
middle = gcd(m, n - m);
}
if(m == n)
{
middle = m;
}
return middle;
}
int lcm(int m, int n)
{
return ((m * n) / gcd(m, n));
}
int main()
{
int te;
int a;
int b;
int c;
int d;
int mu;
int zi;
int t;
scanf("%d", &te);
while(te--)
{
scanf("%d %d %d %d", &a, &b, &c, &d);
mu = lcm(b , d);
zi = mu / b * a + mu / d * c;
t = gcd(mu, zi);
if(t != 1)
{
mu /= t;
zi /= t;
}
printf("%d", zi);
if(mu != 1)
{
printf("/%d", mu);
}
printf("\n");
}
return 0;
}