UVA 839－Not so Mobile

UVA 839－Not so Mobile

题目大意：给出一组秤，问是否平衡，0代表下面是一个秤

解题思路：递归解决

#include <stdio.h>
#include <iostream>
using namespace std;
int com() {
    int a[4];
    for(int i = 0; i < 4; i++)
        cin >> a[i];
    if(a[0] == 0)
        a[0] = com();
    if(a[2] == 0)
        a[2] = com();
    if(a[0] != 0 && a[2] != 0 && a[0]*a[1] - a[2]*a[3] == 0 )
        return a[0] + a[2];
    else
        return 0;

}
int main() {
    int n;
    cin >> n;
    while(n--) {
        int s = com();
        if(s == 0)
            printf("NO\n");
        else
            printf("YES\n");
        if(n != 0)
            printf("\n");
    }
    return 0;
}