ACM 10664 - Luggage

#include <stdio.h>
#define SIZE 21

int luggage[SIZE], changeLine, index;

int getInt()
{
    char ch;
    int n = 0;
    changeLine = 0;
    while( ch = getchar())
        if(ch != ' ' && ch != '\n') break;
    n = ch - 48;
    while( ch = getchar())
    {
        if(ch == ' ' || ch == '\n') break;
        n = n * 10 + ch - 48;
    }
    if (ch == '\n') changeLine = 1;
    return n;
}

int main()
{
    int caseNum, n, i, tmp, a, b;
    caseNum = getInt();
    while (caseNum --)
    {
        index = 0, changeLine = 0, a = 0, b = 0;
        while (!changeLine)
        {
            luggage[index] = getInt();
            for (i = index; i >= 1; i --)
                if (luggage[i] > luggage[i - 1])
                    tmp = luggage[i], luggage[i] = luggage[i - 1], luggage[i - 1] = tmp;
                else break;
            index ++;
        }
        
        for (i = 0; i < index; i ++)
        {
            if (a == b) a += luggage[i];
            else if (a > b) b += luggage[i];
            else a += luggage[i];  
        }
        
        if (a == b) puts("YES");
        else puts("NO");
    }
    return 0;
}

回目錄
回首頁