UVa 839 Not so Mobile
2016-05-02 16:43
405 查看
然而等于是默了一遍标程
1 #include<iostream> 2 #include<algorithm> 3 #include<cstdio> 4 #include<cmath> 5 #include<string> 6 using namespace std; 7 int n; 8 bool bal(int &w){ 9 int w1,w2,d1,d2; 10 bool b1=1,b2=1; 11 scanf("%d%d%d%d",&w1,&d1,&w2,&d2); 12 if(!w1)b1=bal(w1); 13 if(!w2)b2=bal(w2); 14 w=w1+w2; 15 if(b1 && b2 &&(w1*d1==w2*d2))return 1; 16 return 0; 17 } 18 int main(){ 19 cin>>n; 20 int i,w; 21 for(i=1;i<=n;i++){ 22 if(bal(w))printf("YES\n");else printf("NO\n"); 23 if(i<n)cout<<endl; 24 } 25 return 0; 26 }
相关文章推荐
- Quicksum -SilverN
- uva 140 bandwidth (好题) ——yhx
- DP————1011
- uva 129 krypton factors ——yhx
- uva 524 prime ring problem——yhx
- uva 1599 ideal path(好题)——yhx
- uva 11059 maximum product(水题)——yhx
- linux下安装php报错configure: error: Cannot find MySQL header files under /usr/include/mysql.
- BestCoder Round #82 (div.2) (HDU 5675)(HDU 5676)
- Spark History Server配置使用
- Uva10082 WERTYU -S.B.S.
- uva 524 prime ring problem——yhx
- uva 129 krypton factors ——yhx
- uva 140 bandwidth (好题) ——yhx
- Quicksum -SilverN
- UVa 839 Not so Mobile
- UVa 11292 Dragon of Loowater
- NOIP2013普及组 -SilverN
- NOIP2014提高组 DAY1 -SilverN
- Quicksum-S.B.S.