pku1791.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>

int count(int AC, int BD, int E, int F)
{
	int tmp;
	if (AC > BD)
	{
		tmp = AC;
		AC = BD;
		BD = tmp;
	}
	if (E > F)
	{
		tmp = E;
		E = F;
		F = tmp;
	}
	
	if (BD > F || AC > E)
	{
		return 2;
	}
	else if (AC == E && BD == F)
	{
		return -1;
	}
	else if (AC == E || BD == E || BD == F)
	{
		return 0;
	}
	else
	{
		return 1;
	}
}

int main()
{
	int A, B, C, D, E, F, AC, BD, tmp, tmp1;

	while (1)
	{
		scanf("%d %d %d %d %d %d", &A, &B, &C, &D, &E, &F);
		
		if (A == 0)
		{
			break;
		}
		tmp1 = count(A * C, B * D, E, F);
		tmp = count(A * D, B * C, E, F);
		
		tmp = (tmp < tmp1) ? tmp : tmp1;

		if (tmp == 2)
		{
			printf("The paper is too small.\n");
		}else
		{
			printf("The minimum number of cuts is %d.\n", A * B + tmp);
		}
	}
	
	return 0;
}