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

방금 전까지 몇번을 수정해보고 제출했으나 전부 WA입니다

거의 모든 예외를 처리했다고 생각했는데 뭔가 남아있나봐요 -_-;

(↓실제 제출할 때는 테스트 케이스들은 빼고 제출했습니다)

#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 = 100000; /* abbr. of minimum difference */ int minind; /* index, indexing when mind is renewing */ /* test case 1 5 1 2 3 4 6 => (2 + 6 : others) => output : 0 test case 2-1 20 1 6 11 16 22 27 32 37 43 48 53 58 64 69 74 79 85 90 95 100 => (100 + 95 + 90 + 85 + 79 + 58 - 1 : others) => output : 2 test case 2-2 20 1 3 11 17 22 28 33 37 43 48 51 60 64 69 74 79 85 90 95 100 => (100 + 95 + 90 + 85 + 79 + 60 - 3 - 1 : others) => output : 0 */ if( s == 0 ) return 0; for( i = 0; i < s; i++ ) sum += ary[i]; for( i = 0; i < s; s--, minind = -1 ) { for( j = 0; j < s; j++ ) { if( carry <= sum/2 ) opp = carry + ary[j]; else opp = carry - ary[j]; diff = sum - 2 * opp; if( diff < 0 ) diff = -diff; if( mind > diff ) { mind = diff; minind = j; } } if( minind < 0 ) continue; if( carry <= sum/2 ) carry += ary[minind]; else 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)); } }