2020.08.07 I - MaratonIME divides fairly

In a country trip, the contestants decided to play a soccer match. Yan, who was a professional player once, decided not to play to keep the teams balanced. He wanted to participate in another way, so he decided to choose the two teams.

Unfortunately, unlike soccer, Yan is very bad at math and doesn’t know if he divided the teams fairly. Yan considers a division fair if the absolute difference between the number of players in each team is minimum. Can you help him?

Input
The first line has a single integer T, the number of test cases. The next T lines have two integers a and b, the number of players in each team.
1 ≤ T ≤ 1000.
0 ≤ a, b ≤ 109.

Output
Print T lines, one for each test case.
If Yan was fair, output the word “Ok”.
If Yan wasn’t fair, output two integers x and y, x ≤ y, the sizes of the teams in a fair division.

Example
Input
2
2 2
0 2

Output
Ok
1 1

题目大意：
首先输入一个t，表示有t组数据。然后每组输入两个数，
如果这两个数“公平”则输出"Ok".
否则输出调整后的两个数，x<=y;
“公平”：就是两个数的误差不超过1；

题目链接

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int x,y,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&x,&y);
        if(x==y||x+1==y||y+1==x)
        {
            printf("Ok\n");
        }
        else
        {
            if((x+y)%2==0)
            {
                x=(x+y)/2;
                y=x;
            }
            else
            {
                x=(x+y)/2;
                y=x+1;
            }
            printf("%d %d\n",x,y);
        }
    }
    return 0;
}