Feed Ratios USACO 3.2

额，要求都要最小，4重循环直接搜索即可...

/*

ID: hubiao cave

PROG: ratios

LANG: C++

*/




#include<iostream>

#include<fstream>

#include<string>

using namespace std;


bool CanFit(int,int,int,int);
int arry[12];
int main()

{


    ifstream fin("ratios.in");

    ofstream fout("ratios.out");
    for(int i=0;i<12;i++)
        fin>>arry[i];

    for(int i=0;i<=100;i++)
        for(int j=0;j<=100;j++)
          for(int m=0;m<=100;m++)
             for(int n=0;n<=100;n++)
    {
        if(CanFit(i,j,m,n))
        {
            fout<<i<<" "<<j<<" "<<m<<" "<<n<<endl;
            return 0;
        }
    }
    fout<<"NONE"<<endl;
    return 0;


}
bool CanFit(int i,int j,int m,int n)
{
    if(!i&&!j&&!m)
        return false;
    int sum1=i*arry[3]+j*arry[6]+m*arry[9];
    int sum2=i*arry[4]+j*arry[7]+m*arry[10];
    int sum3=i*arry[5]+j*arry[8]+m*arry[11];

    if(sum1==n*arry[0]&&sum2==n*arry[1]&&sum3==n*arry[2])
        return true;
    return false;
}