UVa 562. Dividing Coins. [판정:RE]

-_-; RE가 뭐하면 뜨는건지 잊어버려서 뭘 고쳐야될지 잘 모르겠음요 ㅋㅋㅋㅋ

활동하는 사람이 없으니 이거 원;

#include <stdio.h> void clear( int ary[] ) { int i; for( i = 0; i < 100; i++ ) { ary[i] = 0; } } int mindiff( int ary[], int s ) { int i, j; int sum = 0; int opp; /* abbr. of opponent, take from sum */ int carry = 0; /* addition to opp */ int diff; int mind = 500; /* abbr. of minimum difference */ int minind; /* index, indexing when mind is renewing */ /* test case 1 5 1 2 3 4 6 => (1 3 4 / 2 6) carry = 0 sum = 1 + 2 + 3 + 4 + 6 = 16 opp = 1 diff = sum - 2opp diff < 0? diff = -diff mind > diff? mind = diff => mind == 14, index check opp = 2 ... => mind == 12, index check opp = 3 ... => mind == 10, index check opp = 4 ... => mind == 8, index check opp = 6 ... => mind == 4, index check carry += opp index != s-1? swapping ary[index] and ary[s-1] s-- */ for( i = 0; i < s; i++ ) sum += ary[i]; for( i = 0; i < s; s-- ) { for( j = 0; j < s; j++ ) { opp = carry + ary[j]; diff = sum - 2 * opp; if( diff < 0 ) diff = -diff; if( mind > diff ) { mind = diff; minind = j; } } carry += ary[minind]; if( minind != s-1 ) { int temp; temp = ary[minind]; ary[minind] = ary[s-1]; ary[s-1] = temp; } } return mind; } void main() { int values[100]; int n; int c; /* number of coins */ scanf("%d", &n); for( ; n > 0; n-- ) { int i; clear(values); scanf("%d", &c); for( i = 0; i < c; i++ ) { scanf("%d", &values[i]); } printf("%d\n", mindiff(values, c)); } }


실제 제출할 때는 저 test case 부분은 지우고 냈음//