BOJ 16431 - 베시와 데이지 [C++]

문제

링크

풀이

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
 
void solve(void) {
  int br, bc; cin >> br >> bc;
  int dr, dc; cin >> dr >> dc;
  int jr, jc; cin >> jr >> jc;
 
  int bessie = max(abs(jr-br), abs(jc-bc));
  int daisy = abs(jr-dr) + abs(jc-dc);
  cout << (bessie < daisy ? "bessie" : (bessie > daisy ? "daisy" : "tie"));
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}