Beat the Spread![HDU1194]

最新推荐文章于 2025-09-09 08:37:13 发布

weixin_30699443

最新推荐文章于 2025-09-09 08:37:13 发布

阅读量72

点赞数

CC 4.0 BY-SA版权

文章标签： java

原文链接：http://www.cnblogs.com/dramstadt/p/3202660.html

本文介绍了一个基于输入的总分和两队分数绝对差值来预测最终比分的算法挑战。通过分析给出的数据，程序能够计算并输出可能的比赛结果，或者在没有可行解的情况下返回“impossible”。此问题源自滑铁卢大学2005年的一次本地比赛。

Beat the Spread!

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3482 Accepted Submission(s): 1821

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

Recommend
Ignatius.L

#include<stdio.h>
int main()
{
    int T;
    scanf("%d",&T);
    while (T--)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        if (u<v || (u+v)&1) printf("impossible\n");
        else printf("%d %d\n",(u+v)/2,(u-v)/2);
    }
    return 0;
}

转载于:https://www.cnblogs.com/dramstadt/p/3202660.html