16年大连网络赛 1006 Football Games

题目链接：http://acm.hdu.edu.cn/contests/contest_showproblem.php?cid=725&pid=1006

Football Games

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total
Submission(s): 3505    Accepted Submission(s): 655

Problem Description

A mysterious country will hold a football world
championships---Abnormal Cup, attracting football teams and fans from all around
the world. This country is so mysterious that none of the information of the
games will be open to the public till the end of all the matches. And finally
only the score of each team will be announced.
  
  At the first phase of
the championships, teams are divided into M

groups using the single round robin rule where one and only one game will be
played between each pair of teams within each group. The winner of a game scores
2 points, the loser scores 0, when the game is tied both score 1 point. The
schedule of these games are unknown, only the scores of each team in each group
are available.
  
  When those games finished, some insider revealed that
there were some false scores in some groups. This has aroused great concern
among the pubic, so the the Association of Credit Management (ACM) asks you to
judge which groups' scores must be false.

 

Input

Multiple test cases, process till end of the
input.
  
  For each case, the first line contains a positive integers
M

, which is the number of groups.
  The i

-th of the next M

lines begins with a positive integer Bi

representing the number of teams in the i

-th group, followed by Bi

nonnegative integers representing the score of each team in this
group.

number of test cases <= 10
M<= 100
B[i]<=
20000
score of each team <= 20000

 

Output

For each test case, output M

lines. Output ``F" (without quotes) if the scores in the i-th group must be
false, output ``T" (without quotes) otherwise. See samples for detail.

 

Sample Input

2

3 0 5 1

2 1 1

 

Sample Output

F

T

 

题目大意：足球比赛  输入数据第一行为样例的个数，每个样例第一个数为球队的个数接下来为每个队的得分

　　　　　球队两两之间进行比赛赢的得2分输的得0分 平局各得1分

　　　　　由于...有些队伍的得分出现了错误

　　　　　对于每组样例判断该组样例的数据是否出现错误   错误F 正确T

解题思路：（假设有n个队员）如果数据没有出现错误则一个队员最高得分为2*（n-1），该队得分的总数一定是n*（n-1）两个条件同时满足            则说明数据没有出错。

AC代码：

　　

 #include <stdio.h>
 int main ()
 {
     int t,m,i,a;
     while (~scanf("%d",&t))
     {
         while (t --)
         {
             int f = ; //f = 0表示数据出错，否则数据正确
             scanf("%d",&m);
             int s = *(m-)；//每队中出现的最高得分
             int sum = ;
             for (i = ; i < m; i ++)
             {
                 scanf("%d",&a);
                 if (a < s)  //求每队的总得分 如果出现大于最大得分的不加
                     sum += a;
             }
             if (sum == m*(m-))
                 f = ;
             if (f == )
                 printf("T\n");
             else
                 printf("F\n");
         }
     }
 }