zoukankan      html  css  js  c++  java
  • Hdu 1194 Beat the Spread!

    Beat the Spread!

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

    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

    #include"stdio.h"
    int main()
    {
    	long n,a,b,x,y,s;
     	scanf("%ld",&n);
     	while(n--)
     	{
    	 	scanf("%ld%ld",&a,&b);
    	  	x=(a+b)/2;
    	  	y=(a-b)/2;
    	  	s=a+b;    
    	  	if(s%2!=0) 
    			printf("impossible
    ");//a+b若为奇数,则x讲不会是整数;   else if(x<0||y<0) printf("impossible
    ");
    	  	else
    		  	printf("%ld %ld
    ",x,y);
        }
    	return 0;
    }
    

      

  • 相关阅读:
    事件
    dom对象
    逻辑运算和作用域的问题
    json
    数组
    字符串
    函数
    js的数据类型和全局方法
    js
    10.16 js内容
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057914.html
Copyright © 2011-2022 走看看