Neliöt

#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll t[4];
int main() {
    ll qq;
    cin>>qq;
    for(ll xx = 0; xx < qq; ++xx) {
        for(ll i =0; i < 4; ++i) {
            cin>>t[i];
        }
        sort(t, t+4);
        if(t[2] < t[3]) {
            if(t[0] == t[1] && t[0] == t[3]-t[2] && t[0] * 2 == t[2]) {
                cout<<"10-4\n";
                goto ohi;
            }
            if(t[0] == t[2] && 3*t[0] == t[3]) {
                cout<<"10-4\n";
                goto ohi;
            }
        }
        if(t[2] == t[3] && t[1] < t[2]) {
            if(t[0] == t[1] && 2*t[1] == t[2]) {
                cout<<"10-4\n";
                goto ohi;
            }
        }
        if(t[0] == t[3]) {
                cout<<"10-4\n";
                goto ohi;
        }
        cout<<"QAQ\n";
        ohi:;
    }
 
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED