Not so Mobile

Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of mobile is usually found hanging over cradles of small babies.

The figure illustrates a simple mobile. It is just a wire, suspended by a string, with an object on each side. It can also be seen as a kind of lever with the fulcrum on the point where the string ties the wire. From the lever principle we know that to balance a simple mobile the product of the weight of the objects by their distance to the fulcrum must be equal. That is Wl × Dl = Wr × Dr where Dl is the left distance, Dr is the right distance, Wl is the left weight and Wr is the right weight.

In a more complex mobile the object may be replaced by a sub-mobile, as shown in the next figure. In this case it is not so straightforward to check if the mobile is balanced so we need you to write a program that, given a description of a mobile as input, checks whether the mobile is in equilibrium or not.

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive

The input is composed of several lines, each containing 4 integers separated by a single space. The 4 integers represent the distances of each object to the fulcrum and their weights, in the format: Wl Dl Wr Dr If Wl or Wr is zero then there is a sub-mobile hanging from that end and the following lines define the the sub-mobile. In this case we compute the weight of the sub-mobile as the sum of weights of all its objects, disregarding the weight of the wires and strings. If both Wl and Wr are zero then the following lines define two sub-mobiles: first the left then the right one.

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line. Write ‘YES’ if the mobile is in equilibrium, write ‘NO’ otherwise

Sample Input

1

0 2 0 4

0 3 0 1

1 1 1 1

2 4 4 2

1 6 3 2

Sample Output

YES

题意：输入一个树状天平，根据力矩相等原则判断是否平衡，采用递归方式输入，每个天平格式为Wl，Dl，Wr，Dr，当Wl=Wr=0时，会先描述左子天平，然后是右子天平。

思路：这道题在输入的时候采取了递归方式定义，因此编写一个递归过程进行输入，输入子天平，返回的是子天平是否平衡，输入完之后输出那个最终de的结果即可，代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int solve(int &w)
{
    int w1,d1,w2,d2;
    int b1=1,b2=1;
    scanf("%d %d %d %d",&w1,&d1,&w2,&d2);
    if(w1==0)
        b1=solve(w1);
    if(w2==0)
        b2=solve(w2);
    w=w1+w2;
    return b1&b2&(w1*d1==w2*d2);
}
int main()
{
    int T,w;
    scanf("%d",&T);
    while(T--)
    {
        if(solve(w))
            printf("YES\n");
        else
            printf("NO\n");
        if(T)
            printf("\n");
    }
    return 0;
}