Hduoj1194 【水题】

最新推荐文章于 2021-01-22 18:47:58 发布

乐着过一辈子

最新推荐文章于 2021-01-22 18:47:58 发布

阅读量455

点赞数

分类专栏：水题文章标签： c

本文链接：https://blog.csdn.net/u014641529/article/details/40402969

版权

水题专栏收录该内容

75 篇文章 1 订阅

订阅专栏

/*Beat the Spread!
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4675    Accepted Submission(s): 2434


Problem Description
Superbowl Sunday is nearly here. In order to pass the time waiting for the half-time commercials and wardrobe malfunctions,
 the local hackers have organized a betting pool on the game. Members place their bets on the sum of the two final scores,
  or on the absolute difference between the two scores.

Given the winning numbers for each type of bet, can you deduce the final scores?


Input
The first line of input contains n, the number of test cases. n lines follow, each representing a test case. Each test case 
gives s and d, non-negative integers representing the sum and (absolute) difference between the two final scores.

Output
For each test case, output a line giving the two final scores, largest first. If there are no such scores, output a line 
containing "impossible". Recall that football scores are always non-negative integers.

 

Sample Input
2
40 20
20 40
 

Sample Output
30 10
impossible
 

Source
University of Waterloo Local Contest 2005.02.05 
*/
#include<stdio.h>
int main()
{
	int i, j, k, sum, abss, n;
	float max , min;
	scanf("%d", &n);
	while(n--)
	{
		scanf("%d%d", &sum, &abss);
		max = (float)(sum + abss) / 2.0;
		if( max == (int)max && ((sum - (int)max) >= 0))
		printf("%d %d\n", (int)max, (sum - (int)max) );
		else
		printf("impossible\n");
	}
	return 0;
}