POJ 2707 Copier Reduction解题报告

一、问题描述

 

二、解题思路

思路比较简单，不加详述了，直接看代码。

 

三、代码

 

#include<iostream>
using namespace std;
int main()
{
    int A,B,C,D;
    int t;
    while(scanf("%d%d%d%d",&A,&B,&C,&D))
    {
        if(A==0 && B==0 && C==0 && D==0)
            break;
        if(A<B)
        {
            t=A;A=B;B=t;
        }
        if(C<D)
        {
            t=C;C=D;D=t;
        }
        int p1,p2;
        p1=100*C/A;
        p2=100*D/B;
        p1=p1<p2?p1:p2;
        if(p1>=100)
            cout<<100<<"%"<<endl;
        else
        {
            if(p1<1)
                cout<<1<<"%"<<endl;
            else
            {
                cout<<p1<<"%"<<endl;
            }
        }
    }
    return 0;
}