hdu 1194
来源:互联网 发布:广告设计软件怎么安装 编辑:程序博客网 时间:2024/04/28 17:08
Beat the Spread!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2849 Accepted Submission(s): 1495
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?
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
240 2020 40
Sample Output
30 10impossible
Source
University of Waterloo Local Contest 2005.02.05
Recommend
Ignatius.L
#include <iostream>using namespace std;int main(){int n, s, d, a, b;cin>>n;while (n--) {cin>>s>>d;if (s < d || ((s+d)%2 != 0)) {cout<<"impossible"<<endl;}else {a = (s+d) / 2;b = s - a;if(a < b){a = a^b;b = a^b;a = a^b;}cout<<a<<" "<<b<<endl;}}return 0;}
- hdu 1194
- hdu 1194
- hdu 1194
- hdu 1194
- hdu 1194
- HDU 1194
- hdu(1194)
- HDU 1194 JAVA
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- hdu 1170
- session永不失效
- 2013年农业银行校园招聘计算机部分题目
- JS中typeof与instanceof的区别
- UAC权限的提权与降权
- hdu 1194
- mybatis的resultMap
- iReport与JasperReport中文支持全面解决
- 成功IT外包作推力 详解与业务部门共进退四部曲
- linux 常见缩写
- hdu 1196
- 简单计算器代码
- assembly___经典函数调用printf___操作
- 新青年