D - Not so Mobile

https://vjudge.net/contest/279738#problem/D

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
bool solve(int& W)
{
    int Wl, Dl, Wr, Dr;
    scanf("%d%d%d%d",&Wl,&Dl,&Wr,&Dr);
    bool b1 = true, b2 = true;
    if (!Wl) 
    {
        b1 = solve(Wl);
    }
    if (!Wr) 
    {
        b2 = solve(Wr);
    }
    W = Wl + Wr;
    return b1 && b2 && (Wl * Dl == Wr * Dr);
}
int main()
{
    int t, W;
    scanf("%d",&t);
    while (t--)
    {
        if (solve(W))
            printf("YES\n");
        else
            printf("NO\n");
        if (t)
            printf("\n");
    }
}