POJ 3117 World Cup

World Cup

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9172		Accepted: 4599

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 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

就是一个简单的数学题，我想复杂了，

#include <stdio.h>

int main()
{
	int t,n,m,ans,sum;
	char a[20];
	
	while(scanf("%d%d",&t,&n),t)
	{
		sum=0;
		while(t--)
		{
			scanf("%s%d",a,&m);
			sum+=m;
		}	
		ans=3*n-sum;
		printf("%d\n",ans);
	}
	
	return 0;
}