Description
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 AB
既然都小于p,那么大的不就是答案吗?
#include<cmath> #include<queue> #include<stack> #include<string> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<functional> using namespace std; typedef long long LL; const int maxn=1e5+10; int T,n,c,a,b; int main() { scanf("%d",&T); while (T--) { scanf("%d%d%d",&c,&a,&b); if (a>b) printf("A\n"); else printf("B\n"); } return 0; }