(poj1.3.2)1791(构造法模拟)
/* * 1791_1.cpp * * Created on: 2013年10月6日 * Author: Administrator */#include <iostream>#include <cstdio>using namespace std;const int TOO_BIG = INT_MAX;int ncuts(int a,int b,int c,int d,int e,int f){if(a*c > e || b*d > f){return TOO_BIG;}return a*b - 1 + (a*c < e) +(b*d < f);}void do_solve(int a , int b , int c,int d, int e, int f){int m = ncuts(a,b,c,d,e,f); int x = 0;if( (x = ncuts(b,a,c,d,e,f)) < m){m = x;}if( (x = ncuts(a,b,d,c,e,f)) < m){m = x;}if((x = ncuts(b,a,d,c,e,f)) < m ){m = x;}if(m == TOO_BIG){printf("The paper is too small.\n");}else{printf("The minimum number of cuts is %d.\n",m);}}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&&b&&c&&d&&e&&f){do_solve(a,b,c,d,e,f);}}