UVA839 - Not so Mobile
2015-03-03 10:20
405 查看
递归的练习题,类似于C语言的递归快速求和
#include <stdio.h> int solve(int *w){ int w1,d1,w2,d2; bool t1 = 1, t2 = 1; scanf("%d %d %d %d",&w1,&d1,&w2,&d2); !w1&&(t1=solve(&w1)); !w2&&(t2=solve(&w2)); *w=w1+w2; return t1&&t2&&(w1*d1==w2*d2); } int main(){ int T,w; scanf("%d",&T); while(T--){ printf("%s\n",(solve(&w)? "YES" :"NO")); T&&putchar(10); } return 0; }
相关文章推荐
- UVA 839 Not so Mobile
- uva 839 Not so Mobile-S.B.S.
- UVA 839 - Not so Mobile
- uva 839 not so mobile——yhx
- 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
- UVa 839 Not so Mobile(树的递归输入)
- uva 839 Not so Mobile-S.B.S.
- UVa 839 Not so Mobile (树的深度优先搜索)
- UVA 839 Not so Mobile
- UVA 839 Not so Mobile (递归建立二叉树)
- uva839 not so mobile
- uva839 Not so Mobile (重建二叉树)
- UVA 839 Not so Mobile
- UVa839 Not so Mobile
- uva 839 Not so Mobile