Poj 3117 World Cup
2014-12-04 13:09
281 查看
1.Link:
http://poj.org/problem?id=3117
2.Content:
World Cup
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
Sample Output
Source
South America 2006, Brazil Subregion
3.Method:
4.Code:
5.Reference:
http://poj.org/problem?id=3117
2.Content:
World Cup
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 8778 | Accepted: 4406 |
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 3 Brasil 3 Australia 3 Croacia 3 3 3 Brasil 5 Japao 1 Australia 1 0 0
Sample Output
0 2
Source
South America 2006, Brazil Subregion
3.Method:
4.Code:
1 #include <iostream> 2 #include <cstdio> 3 4 using namespace std; 5 6 int main() 7 { 8 int i; 9 int t,n; 10 int num,a; 11 char ch[12]; 12 while((cin>>t>>n)&&(t!=0||n!=0)) 13 { 14 num=0; 15 for(i=0;i<t;i++) 16 { 17 scanf("%s",ch); 18 cin>>a; 19 num+=a; 20 } 21 cout<<(3*n-num)<<endl; 22 } 23 //system("pause"); 24 return 0; 25 }
5.Reference:
相关文章推荐
- POJ 3117 World Cup G++
- poj 3117 World Cup
- POJ 3117 World Cup
- POJ 3117 World Cup (简单数学题) --from lanshui_Yang
- poj 3117 World Cup 规律
- POJ3117——World Cup
- poj 3117 World Cup
- 【POJ】:POJ 3117 World Cup
- poj 3117 World Cup
- poj 3117(简单数学题) World Cup
- POJ 3117 World Cup
- poj 3117 World Cup(简单数学题)
- poj 3117 水题 World Cup
- Poj 3117 World Cup
- POJ 3117 World Cup(我的水题之路——世界杯平局数目)
- POJ 3117 World Cup(水~)
- poj 3117 World Cup
- POJ 1953 World Cup Noise
- POJ-1953-World Cup Noise
- POJ-3117