HDU 1194 Beat the Spread!

最新推荐文章于 2018-04-21 14:30:46 发布

原创最新推荐文章于 2018-04-21 14:30:46 发布 · 471 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#output #each #numbers #input

hdu ACM 水题128题专栏收录该内容

61 篇文章

订阅专栏

本文介绍了一个基于总分和分差预测两支队伍最终得分的编程挑战。通过输入两队的总分及绝对分差，利用简单的数学计算来推测每支队伍的得分。如果无法根据给定的数据推算出合理的得分，则输出'impossible'。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Beat the Spread!

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

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

Sample Output

  
   30 10
impossible

Source

University of Waterloo Local Contest 2005.02.05

Recommend

Ignatius.L

分析：题意就是给你2个人得总分和2个人的分差，计算出2个人的成绩，简单的数学题

代码：

#include<stdio.h>

int main()
{
    int N;
    scanf("%d",&N);
    while(N--)
    {
        int sum,dif;
        scanf("%d%d",&sum,&dif);
        if((sum-dif)<0)
            printf("impossible\n");
        else if((sum-dif)%2!=0)
            printf("impossible\n");
        else
            printf("%d %d\n",(sum+dif)/2,(sum-dif)/2);
    }
    return 0;
}