In the television program "Shopping Street" of CCTV-2, two people, A and B are guessing price of a given item. You are asked to decide whose price is closer to the real price.
Input
There are multiple test cases. The first line of input is an integer T (T <= 10) indicating the number of test cases.
Each case contains three integers in one line: P, PA, PB (0 <= PA, PB <= P <= 100, PA != PB), indicating the real price, the price A guesses and the price B guesses.
Output
For each case, output "A" or "B" according to whose price is closer to the real price.
Sample Input
3 10 8 7 20 20 19 100 9 50
Sample Output
A A B
Author: HANG, Hang
Source: The 7th Zhejiang Provincial Collegiate Programming Contest
题意:给出一个数,有两个人各猜了个不同的数,问谁猜的和这个数更近
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>
using namespace std;
#define LL long long
const int INF=0x3f3f3f3f;
const int MAX=100009;
int main()
{
int n,x,y;
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d %d %d",&n,&x,&y);
if(abs(n-x)<abs(n-y)) printf("A\n");
else printf("B\n");
}
return 0;
}