UVA 839 - Not so Mobile
2014-09-29 19:37
447 查看
这题处理两次,看了别人的代码才知道,原来判断不平衡后,不能立即返回,必须将输入全部读入,否则会影响下一组的解答。
#include <iostream> using namespace std; int f() { int dl , wl; int dr , wr; int ok = 1; cin >> wl >> dl >> wr >> dr; if(!wl) { wl = f(); if(wl<0) ok = 0; } if(!wr) { wr = f(); if(wr < 0) ok = 0; } if(!ok || wl * dl != wr * dr) return -1; return wl + wr ; } int main() { int n; cin >> n; for(int i = 0 ; i < n ; ++i) { if(f() < 0) cout << "NO" << endl; else cout << "YES" << endl; if(i < n-1) cout << endl; } return 0; }
相关文章推荐
- Not so Mobile UVA - 839
- UVA 839 Not so Mobile
- UVA - 839 Not so Mobile
- (UVA - 839) Not so Mobile(递归+引用,树的先序遍历)
- uva 839 - Not so Mobile
- uva-839 Not so Mobile
- Uva 839 Not so Mobile
- UVA839 - Not so Mobile
- UVa 839 (递归方式读取二叉树) Not so Mobile
- Not so Mobile UVA 839
- UVA - 839 Not so Mobile
- UVA 839 - Not so Mobile
- UVA 839 Not so Mobile
- UVA839 - Not so Mobile
- UVA 839 Not so Mobile(二叉树经典题)
- UVA 839 Not so Mobile (贪心)
- UVa839 Not so Mobile
- uva 839 Not so Mobile
- UVA - 839 Not so Mobile
- UVa 839 - Not so Mobile