Not so Mobile

原创 2016年08月31日 09:37:32

【题目描述】
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.
【输入格式】
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.
【输出格式】
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.
【样例输入】
1

0 2 0 4
0 3 0 1
1 1 1 1
2 4 4 2
1 6 3 2
【样例输出】
YES
【分析】
递归,边读入边求解。

#include<iostream>
using namespace std;
bool solve(int& w)
{
    int w1,d1,w2,d2;
    bool b1=true,b2=true;
    cin>>w1>>d1>>w2>>d2;
    if (!w1) b1=solve(w1);
    if (!w2) b2=solve(w2);
    w=w1+w2;'
    return b1 && b2 && (w1*d1==w2*d2);
}
int main()
{
    int t,w;
    cin>>t;
    while (t--) {
        if (solve(w)) cout<<"YES\n"; else cout<<"NO\n";
        if (t) cout<<"\n";
    }
    return 0;
}
版权声明:本文原创,可以转载,但需附上原文链接,否则你的生命将会-1s!!!! 举报

相关文章推荐

Not so Mobile

Not so Mobile  Before being an ubiquous communications gadget, a mobile was just a stru...

uva 839 Not so Mobile

uva 839 Not so Mobile

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

UVa 839 Not so Mobile(树的递归输入)

题意  判断一个树状天平是否平衡   每个测试样例每行4个数  wl,dl,wr,dr  当wl*dl=wr*dr时  视为这个天平平衡  当wl或wr等于0是  下一行将是一个子天平  如果子天平平...
  • acvay
  • acvay
  • 2014-09-24 09:17
  • 1089

Uva - 839 - Not so Mobile

Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wi...

839 - Not so Mobile

Not so Mobile PS:因为该题排版较麻烦,这里给出OJ网址:UVa839 - Not so Mobile 输入一个树状天平,根据力矩相等原则判断是否平衡。如图6-5所示,所谓力矩相等...

UVaOJ839---Not so Mobile

839 - Not so Mobile Time limit: 3.000 seconds Before being an ubiquous communications gadget, ...

UVa839-Not so Mobile (天平)

UVa839-Not so Mobile (天平) 输入一个树状天平,根据力矩相等原则判断是否平衡。所谓力矩相等,就是W1D1=W2D2,其中W1,W2分别为左右两边砝码的重量,D为距离。  采用递归...

UVa 839 Not so Mobile (DFS二叉树)

839 - Not so Mobile Time limit: 3.000 seconds  http://uva.onlinejudge.org/index.php?option=com_onl...

UVa 839 - Not so Mobile

Not so Mobile Before being an ubiquous communications gadget, a mobile was just a structure made ...

uva 839 Not so Mobile

这道题目给的数据的节点的遍历次序有点怪,有点像层次遍历,又有点像先序遍历,但都不是,所以要自己写一个比较怪的递归构建二叉树的函数,二叉树构建出来之后,接下来的工作就简单了,利用先序遍历递归更新每个节点...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)