UVA-839-二叉树-一个有意思的题目

#include<stdio.h>
#include<iostream>
#include<queue>
#include<memory.h>
using namespace std;

const int MAX = 1000;

int read(int* ok)
{
	int wl, dl, wr, dr;
	//cin >> wl >> dl >> wr >> dr;
	scanf("%d %d %d %d",&wl, &dl, &wr, &dr);
	if(wl == 0)
		wl = read(ok);
	if(wr == 0)
		wr = read(ok);
	if(wl * dl != wr * dr)
		*ok = 0;
	return wl + wr;
}
int main()
{
	freopen("d:\\1.txt", "r", stdin);
	int n;
	cin >> n;
	while (n--)
	{
		int ok = 1;
		read(&ok);
		if(ok)
		{
			cout << "YES" << endl;
		}
		else
			cout << "NO" << endl;
		if(n != 0)
			cout << endl;
	}
	return 0;
}