难度:3
二叉树的递归输入,以及引用的妙用,这道题还要多看看。
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
bool solve(int &w) {
int w1, d1, w2, d2;
cin >> w1 >> d1 >> w2 >> d2;
bool judge1 = true;
bool judge2 = true;
if (!w1) judge1 = solve(w1);
if (!w2) judge2 = solve(w2);
w = w1 + w2;
return judge1 && judge2 && (w1 * d1 == w2 * d2);
}
int main() {
int t;
cin >> t;
while (t--) {
int x;
cout << (solve(x) ? "YES" : "NO") << endl;
if (t) cout << endl;
}
return 0;
}