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 inputs.
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
题解:题目https://cn.vjudge.net/contest/248639#problem/B
输入四个数字,分别是天平左边的重量,力臂,右边的重量,力臂。如果左边(右边)重量为0,则左边(右边)下面就还悬挂一个天平,下一行给出。如果天平是平衡的,则输出YES,否则输出NO。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int flag;
int dfs()
{
int l,ll,r,rr;
scanf("%d%d%d%d",&l,&ll,&r,&rr);
if(l==0)//为0时进行递归,回溯时带回值
l=dfs();
if(r==0)
r=dfs();
if(l*ll!=r*rr)
flag=0;
return l+r;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
flag=1;
dfs();
if(flag)
printf("YES\n");
else
printf("NO\n");
if(t)
printf("\n");
}
return 0;
}