简单题。
thestoryofsnow | 2301 | Accepted | 132K | 0MS | C++ | 706B |
/*
ID: thestor1
LANG: C++
TASK: poj2301
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>
using namespace std;
int main()
{
int T;
scanf("%d", &T);
for (int t = 0; t < T; ++t)
{
int sum, diff;
scanf("%d%d", &sum, &diff);
int a = (sum + diff) / 2, b = (sum - diff) / 2;
if (a >= 0 && b >= 0 && a + b == sum && a - b == diff)
{
printf("%d %d\n", a, b);
}
else
{
printf("impossible\n");
}
}
return 0;
}