超水的一題，輸入(x+y)和(x-y) ?輸出x,y，但是注意輸出x,y都為非負(fù)整數(shù)（因為這個我還wa了兩次。。唉~~）

Beat the Spread!

Time Limit:?1000MS	?	Memory Limit:?65536K
Total Submissions:?18154	?	Accepted:?8676

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

Waterloo local 2005.02.05

?

1 //oimonster 2 #include<cstdio> 3 #include<cstdlib> 4 #include<iostream> 5 using namespace std; 6 int main(){ 7 int i,j,n,a,b,c,d; 8 scanf("%d",&n); 9 for(i=1;i<=n;i++){ 10 scanf("%d%d",&a,&b); 11 c=(a+b)/2; 12 d=(a-b)/2; 13 if((c<0)||(d<0)||((a+b)%2!=0))printf("impossible\n"); 14 else printf("%d %d\n",c,d); 15 } 16 return 0; 17 } View Code

?

轉(zhuǎn)載于:https://www.cnblogs.com/oimonster/p/4338617.html

總結(jié)

以上是生活随笔為你收集整理的POJ 2301 Beat the Spread!的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。