zoukankan      html  css  js  c++  java
  • Beat the Spread![HDU1194]

    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
    ");
            else printf("%d %d
    ",(u+v)/2,(u-v)/2);
        }
        return 0;
    }
    

     

  • 相关阅读:
    关于我成为电脑维修社团一员那些事
    [算法相关]二进制分组
    [题解]陌上花开
    [题解]UVA10917 Walk Through the Forest
    [字符串相关]后缀自动机(SAM)- 一
    [字符串相关]后缀数组
    [字符串相关]Aho-Corasick 自动机
    [算法入门]线性基
    [数据结构]可持久化并查集
    [数据结构]可持久化线段树
  • 原文地址:https://www.cnblogs.com/dramstadt/p/3202660.html
Copyright © 2011-2022 走看看