1835.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1835 on 2006-08-25 at 00:31:48 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 1024;
const int INF = 1 << 30;

int cut(int, int, int, int);

int main()
{
	int a, b, c, d, e, f;
	
	while(scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f) != EOF && a != 0) {
		int cn = INF;
		cn <?= cut(a*c, b*d, e, f);
		cn <?= cut(b*d, a*c, e, f);
		cn <?= cut(a*d, b*c, e, f);
		cn <?= cut(b*c, a*d, e, f);
		if(cn == INF) printf("The paper is too small.\n");
		else printf("The minimum number of cuts is %d.\n", a*b-1+cn);
	}
	
	return 0;
}

int cut(int w1, int h1, int w2, int h2)
{
	if(w1 > w2 || h1 > h2) return INF;
	int cn = 2;
	if(w1 == w2) cn--;
	if(h1 == h2) cn--;
	return cn;
}