UVA-102

UVA-102   Ecological Bin Packing

這題搞笑啊..

#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
    long long int can[3][3];
    long long int pos[6],ans;
    while(scanf("%lld%lld%lld%lld%lld%lld%lld%lld%lld",&(can[0][0]),&(can[0][1]),&(can[0][2]),&(can[1][0]),&(can[1][1]),&(can[1][2]),&can[2][0],&can[2][1],&can[2][2])!=EOF){
        pos[1]=can[0][1]*1+can[0][2]*1+can[1][0]*1+can[1][2]*1+can[2][0]*1+can[2][1]*1;
        pos[0]=can[0][1]*1+can[0][2]*1+can[1][0]*1+can[1][1]*1+can[2][0]*1+can[2][2]*1;
        pos[4]=can[0][0]*1+can[0][2]*1+can[1][1]*1+can[1][2]*1+can[2][0]*1+can[2][1]*1;
        pos[5]=can[0][0]*1+can[0][2]*1+can[1][0]*1+can[1][1]*1+can[2][1]*1+can[2][2]*1;
        pos[2]=can[0][0]*1+can[0][1]*1+can[1][1]*1+can[1][2]*1+can[2][0]*1+can[2][2]*1;
        pos[3]=can[0][0]*1+can[0][1]*1+can[1][0]*1+can[1][2]*1+can[2][1]*1+can[2][2]*1;
        ans=pos[0];
        for(int i=1;i<6;i++)
            ans=(ans<pos[i])?(ans):(pos[i]);
        for(int i=0;i<6;i++){
            if(ans==pos[i]){
                switch(i){
                    case 0:
                        cout<<"BCG ";
                        break;
                    case 1:
                        cout<<"BGC ";
                        break;
                    case 2:
                        cout<<"CBG ";
                        break;
                    case 3:
                        cout<<"CGB ";
                        break;
                    case 4:
                        cout<<"GBC ";
                        break;
                    case 5:
                        cout<<"GCB ";
                        break;    
                }
                cout<<pos[i]<<'\n';
                break;
            }
        }
    }
return 0;    
}

完全賣萌030