程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> 杭電 HDU 1194 Beat the Spread!

杭電 HDU 1194 Beat the Spread!

編輯:C++入門知識

杭電 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): 5192 Accepted Submission(s): 2705



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
using namespace std;
int main()
{
	int t,a,b;
	cin>>t;
	while(t--)
	{int x,y;
		cin>>a>>b;
		if(a

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved