1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 | #include <vector>#include <list>#include <map>#include <set>#include <deque>#include <queue>#include <stack>#include <bitset>#include <algorithm>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <cctype>#include <string>#include <cstring>#include <cstdio>#include <cmath>#include <cstdlib>#include <ctime>using namespace std;int solve(){ //平衡返回支点的总重量,否则返回-1 int lw,ld,rw,rd; scanf("%d%d%d%d",&lw,&ld,&rw,&rd); if(!lw) lw = solve(); if(!rw) rw = solve(); return lw*ld == rw*rd?lw+rw:-1;}int main(){ int cntcase; scanf("%d",&cntcase); while(cntcase--){ if(~solve()) puts("YES"); else puts("NO"); if(cntcase) puts(""); } return 0;} |
[2016-02-09][UVA][839][Not so Mobile]
原文：http://www.cnblogs.com/qhy285571052/p/5185504.html