POJ3117——World Cup
来源:互联网 发布:java经典实例 编辑:程序博客网 时间:2024/06/09 21:51
Description
A World Cup of association football is being held with teams from around the world. The standing is based on the number of points won by the teams, and the distribution of points is done the usual way. That is, when a teams wins a match, it receives 3 points; if the match ends in a draw, both teams receive 1 point; and the loser doesn’t receive any points.
Given the current standing of the teams and the number of teams participating in the World Cup, your task is to determine how many matches ended in a draw till the moment.
Input
The input contains several test cases. The first line of a test case contains two integers T and N, indicating respectively the number of participating teams (0 ≤ T ≤ 200) and the number of played matches (0 ≤ N ≤ 10000). Each one of the T lines below contains the name of the team (a string of at most 10 letter and digits), followed by a whitespace, then the number of points that the team obtained till the moment. The end of input is indicated by T = 0.
Output
For each one of the test cases, your program should print a single line containing an integer, representing the quantity of matches that ended in a draw till the moment.
Sample Input
3 3Brasil 3Australia 3Croacia 33 3Brasil 5Japao 1Australia 10 0
Sample Output
02
Source
题意:
根据比赛队伍数量 t 和 比赛次数 b 然后根据输入的t个队伍的得分求出打平的比赛次数。
赢得比赛得3分,比赛打平得1分,输的队伍不得分。
解:
假设每次比赛都赢的话,总分应该是3*n,实际总分为sum,那么造成分数差异的原因是打平的比赛,所以打平的比赛场数为:3*n-sum
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;int main(){int n,t;while(~scanf("%d %d",&n,&t),n){int sum,answer;sum=0;for(int i=0;i<n;i++){int x;string temp;cin>>temp>>x;sum+=x;}answer=3*t-sum;printf("%d\n",answer);}return 0;}
- POJ3117——World Cup
- poj3117
- World Cup——世界杯的另类读法
- World Cup——世界杯的另类读法
- UVALive 7147 World Cup ——思维题
- world cup
- POJ 3117 World Cup(我的水题之路——世界杯平局数目)
- 【多过程模拟】CodeForce 19A——World Football Cup
- 1011. World Cup Betting (20)——PAT (Advanced Level) Practise
- PAT程序设计考题——甲级1011( World Cup Betting ) C++实现
- pku_1953 World Cup Noise
- PKUOJ1593 World Cup Noise
- POJ 3117 World Cup
- poj 3117 World Cup
- POJ1953 World Cup Noise
- 1011. World Cup Betting
- 1011. World Cup Betting
- PAT1011. World Cup Betting
- Android动画学习总结
- 自动筛选的逻辑(6)-对可见单元“写”数据
- iOS 探讨之 HTTP MIME Content-Type
- 您应该知道的UNIX工具系列之2:Netcat
- 通过Hibernate操纵对象(下)
- POJ3117——World Cup
- 简单粗暴:使用pycharm安装对应的Python版本第三方包
- lvs(+keepalived)、haproxy(+heartbeat)、nginx 负载均衡的比较分析
- 文件下载功能
- Apache2.4负载均衡配置
- MyEclipse安装JS代码提示(Spket插件)
- 自动筛选的逻辑(7)-与数据透视表的筛选不同
- linux中如何将多个静态库合并成一个
- jquery入门