zoj 1558 Euro Efficiency

#include <stdio.h> #include <iostream> using namespace std; int F[ 205 ];int C[ 7 ];int main(){    int T;    while ( ~scanf("%d",&T))    while ( T -- ) {        for ( int i = 1 ; i <= 6 ; ++ i ) scanf("%d",&C[ i ]);        for ( int i = 0 ; i <= 200 ; ++ i ) F[ i ] = i;        for ( int k = 0 ; k <= 100 ; ++ k )        for ( int i = 6 ; i >= 1 ; -- i ) { for ( int j = 200 ; j >= C[ i ] ; -- j )     if ( F[ j ] > F[ j-C[ i ] ] + 1 )         F[ j ] = F[ j-C[ i ] ] + 1; for ( int j = 0 ; j <= 200-C[ i ] ; ++ j )     if ( F[ j ] > F[ j+C[ i ] ] + 1 )         F[ j ] = F[ j+C[ i ] ] + 1;        }        int Sum = 0,Max = 0;        for ( int i = 1 ; i <= 100 ; ++ i ) { Sum += F[ i ]; if ( Max < F[ i ] )      Max = F[ i ];        }        printf("%d.%d %dn",Sum/100,Sum%100,Max);    }    return 0;}