Uva839-not so mobile

Meaning: distance * weight, which must be equal to the left and right sides of each node of the entire balance

Idea: use recursion to determine from the bottom layer whether it is equal

# Include <stdio. h> int flag; int DFS () {int wl, DL, wR, Dr; scanf ("% d", & wl, & DL, & WR, & Dr); If (WL = 0) WL = DFS (); If (wR = 0) wR = DFS (); if (WL * dl = WR * Dr) return WL + WR; elsereturn flag = 0;} int main () {int CAS; scanf ("% d ", & CAS); While (CAS --) {flag = 1; DFS (); If (FLAG) printf ("Yes \ n"); elseprintf ("NO \ n "); if (CAS) printf ("\ n");} return 0 ;}