//天平问题
#include<bits/stdc++.h>
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"<<endl;
else cout << "NO" <<endl;
if(T) cout << endl;
}
return 0;
}
UVa839_(二叉树递归_天平问题)
最新推荐文章于 2021-07-25 09:22:34 发布