2388.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<cstdio>

int main()
{
    //freopen("in.txt","r",stdin);
    int N;
    scanf("%d\n",&N);
    while(N--)
    {
        int s,d;
        scanf("%d %d\n",&s,&d);
        int big=0,small=0;
        big = (s+d)/2;
        small = (s-d)/2;
        if(small < 0 || big*2 != s+d) printf("impossible\n");
        else printf("%d %d\n",big,small);    
    }

}