ACM102

用了很愚蠢的寫法 , 所謂的暴力解 ?
但最後還是眼睛長包皮， 沒有看清楚spec 囧

// Ecological Bin Packing
#include iostream

using namespace std;

struct bin {
int brown;
int green;
int clean;
};

bool input(struct bin in[])
{
for(int i = 0; i <>> in[ i ].brown ) ) return false;
if ( !( cin >> in[ i ].green ) ) return false;
if ( !( cin >> in[ i ].clean ) ) return false;
}
return true;
}

int main()
{
bin mybin[3];

while( input( mybin ) ) {

char condition[6][3];
int move[6];

condition[0][0] = 'B';
condition[0][1] = 'G';
condition[0][2] = 'C';
move[0] = mybin[0].green + mybin[0].clean + mybin[1].brown + mybin[1].clean + mybin[2].green + mybin[2].brown;
condition[1][0] = 'B';
condition[1][1] = 'C';
condition[1][2] = 'G';
move[1] = mybin[0].green + mybin[0].clean + mybin[1].brown + mybin[1].green + mybin[2].clean + mybin[2].brown;
condition[2][0] = 'C';
condition[2][1] = 'B';
condition[2][2] = 'G';
move[2] = mybin[0].green + mybin[0].brown + mybin[1].green + mybin[1].clean + mybin[2].clean + mybin[2].brown;
condition[3][0] = 'C';
condition[3][1] = 'G';
condition[3][2] = 'B';
move[3] = mybin[0].green + mybin[0].brown + mybin[1].brown + mybin[1].clean + mybin[2].green + mybin[2].clean;
condition[4][0] = 'G';
condition[4][1] = 'C';
condition[4][2] = 'B';
move[4] = mybin[0].brown + mybin[0].clean + mybin[1].brown + mybin[1].green + mybin[2].green + mybin[2].clean;
condition[5][0] = 'G';
condition[5][1] = 'B';
condition[5][2] = 'C';
move[5] = mybin[0].brown + mybin[0].clean + mybin[1].green + mybin[1].clean + mybin[2].green + mybin[2].brown;

int min = move[0];
int idx = 0;
for ( int i = 1; i < min =" move[i];" idx =" i;" idx =" i;" idx =" i;" idx =" i;">