A. The King's Race

签.

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 #define ll long long
 5 ll n, x, y;
 6 
 7 ll f(ll a, ll b)
 8 {
 9     return max(abs(a - x), abs(b - y));
10 }
11 
12 int main()
13 {
14     while (scanf("%lld%lld%lld", &n, &x, &y) != EOF)
15     {
16         puts(f(1, 1) <= f(n, n) ? "White" : "Black");
17     }
18     return 0;
19 }
View Code

相关文章:

  • 2022-12-23
  • 2021-08-31
  • 2021-07-29
  • 2021-12-11
  • 2022-02-05
  • 2021-05-23
  • 2021-05-27
猜你喜欢
  • 2021-09-26
  • 2021-04-28
  • 2022-03-10
  • 2021-06-13
  • 2021-07-10
  • 2022-12-23
相关资源
相似解决方案