ZOJ Problem Set - 2388 Beat the Spread!

最新推荐文章于 2020-09-26 23:32:47 发布

原创最新推荐文章于 2020-09-26 23:32:47 发布 · 388 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个简单的算法问题，挑战读者根据给定的总分和得分差距来推断比赛的最终比分。通过一系列数学条件判断，该问题提供了一个有趣的视角来理解如何通过已知条件反推未知数。

Beat the Spread!

Time Limit: 2 Seconds Memory Limit: 65536 KB

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

分析：

水题，忽略它。

ac代码：

#include <iostream>
#include<cstdio>
using namespace std;

int main()
{
int n,a,b;
// int ta,tb;
scanf("%d",&n);
while(n--)
{
scanf("%d%d",&a,&b);
if((a+b)%2==0&&a>=b)
printf("%d %d\n",(a+b)/2,(a-b)/2);
else printf("impossible\n");
}
return 0;
}