COJ：General Election 题解

COJ：General Election 题解2015-02-25

Description

General Election is over, now it is time to count the votes！ There are n （2 <= n <= 5） candidates and m （1 <= m <= 100）vote regions. Given the number of votes for each candidate from each region, determine which candidate is the winner （one with the most votes）.

Input specification

The first line of input contains an integer T （1 <= T <= 100）, the number of test cases follow. Each test case starts with two integers n and m denoting the number of candidate and number of region. The next m lines each contains n integers,V1, V2, ..., Vn （0 <= Vi <= 1000） the number of votes for candidate i.

Output specification

For each test case, output in a line the winning candidate. You may safely assume that the winner is unique.

Sample input

23 3159 213 450512 890 993215 420 3972 540 6435 12102 5843 1579 41

Sample output

还以为这样的题目会要考虑溢出问题呢，这个OJ系统不用，看来还是挺简单的。

不过遇上整数就想到溢出问题是程序员的基本素质了。

void GeneralElection（）{int T = 0, cans = 0, regions = 0, c = 0;cin>>T;while （T--）{int votes[5] = {0};cin>>cans>>regions; for （int j = 0; j < regions; j++）{for （int i = 0; i < cans; i++）{cin>>c;votes[i] += c;}}int j = 0;for （int i = 1; i < cans; i++）{if （votes[j] < votes[i]） j = i;}cout<<j+1<<endl;}}

http://coj.uci.cu/24h/problem.xhtml？abb=1003