TOJ 2541: Paper Cutting

Posted 2020-10-10 BobHuang

2541: Paper Cutting 

Time Limit(Common/Java):1000MS/10000MS     Memory Limit:65536KByte
Total Submit: 1            Accepted:1

Description

ACM managers need business cards to present themselves to their customers and partners. After the cards are printed on a large sheet of paper, they are cut with a special cutting machine. Since the machine operation is very expensive, it is necessary to minimize the number of cuts made. Your task is to find the optimal solution to produce the business cards. 

There are several limitations you have to comply with. The cards are always printed in a grid structure of exactly a * b cards. The structure size (number of business cards in a single row and column) is fixed and cannot be changed due to a printing software restrictions. The sheet is always rectangular and its size is fixed. The grid must be perpendicular to the sheet edges, i.e., it can be rotated by 90 degrees only. However, you can exchange the meaning of rows and columns and place the cards into any position on the sheet, they can even touch the paper edges. 

For instance, assume the card size is 3 * 4 cm, and the grid size 1 * 2 cards. The four possible orientations of the grid are depicted in the following figure. The minimum paper size needed for each of them is stated. 

The cutting machine used to cut the cards is able to make an arbitrary long continuous cut. The cut must run through the whole piece of the paper, it cannot stop in the middle. Only one free piece of paper can be cut at once -- you cannot stack pieces of paper onto each other, nor place them beside each other to save cuts.

 

Input

The input consists of several test cases. Each of them is specified by six positive integer numbers, A,B,C,D,E,F, on one line separated by a space. The numbers are: 
A and B are the size of a rectangular grid, 1 <= A,B <= 1 000, 
C and D are the dimensions of a card in cms, 1 <= C,D <= 1 000, and 
E and F are the dimensions of a paper sheet in cms, 1 <= E,F <= 1 000 000. 
The input is terminated by a line containing six zeros.

Output

For each of the test cases, output a single line. The line should contain the text: "The minimum number of cuts is X.", where X is the minimal number of cuts required. If it is not possible to fit the card grid onto the sheet, output the sentence "The paper is too small." instead.

Sample Input

 

Sample Output

 

Source

CTU Open 2003

Tag

要切一种卡片 纸张大小事px,py
格子大小gx，gy 卡片要cx，xy;
于是每次就要切出gx*gy个大小为cx*cy的卡片 问最少切几次
关键是：
1：一次只能切连续，不能在中间中断 故只能一横或一竖切下来
2：每次只能切连在一起的纸 若你之前被切开的则不能一起切 当然纸张更不能折叠来切
（观察sample就可以知道了，然后对于大小为n*m的格子只要切n*m-1次就行了当然还要再检验一下边角需不需要切）
枚举所有情况啊

#include<stdio.h>
int a,b,c,d,e,f;
const int INF=1<<30;
int la(int w,int x,int y,int z)
{
    if(w*y>e||x*z>f)return INF;
    return w*x-1+(w*y<e)+(x*z<f);
}
int main()
{
    while(~scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f),a||b||c||d||e||f)
    {
        int m=la(a,b,c,d),x;
        if((x=la(b,a,c,d))<m)m=x;
        if((x=la(a,b,d,c))<m)m=x;
        if((x=la(b,a,d,c))<m)m=x;
        if(m==INF)printf("The paper is too small.\n");
        else printf("The minimum number of cuts is %d.\n",m);
    }
    return 0;
}