Neliöt

// A
 
#include <iostream>
#include <algorithm>
#include <vector>
 
using namespace std;
 
typedef long long int ll;
 
bool test(ll a, ll b, ll c, ll d) {
  vector<ll> v = {a, b, c, d};
  sort(v.begin(), v.end());
  if (v[0] == v[3])
    return true;		// All same size
  if (v[0] == v[1] && 2*v[0] == v[2] && (v[2] == v[3] || v[0] + v[2] == v[3]))
    return true;
  if (v[0] == v[2] && 3*v[0] == v[3])
    return true;
  return false;
}
 
int main() {
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    if (test(a, b, c, d)) {
      cout << "10-4\n";
    } else {
      cout << "QAQ\n";
    }
  }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED