Neliöt

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
 
typedef long long LL;
using namespace std;
 
void solve(){
    vector<LL> v(4);
    cin >> v[0] >> v[1] >> v[2] >> v[3];
    sort(v.begin(), v.end());
    do{
        LL a = v[0]; LL b = v[1]; LL c = v[2]; LL d = v[3];
        if(a > b) continue;
        if(a == b && b == c && c == d){
            cout << "10-4" << "\n"; return;
        }
        if(a == b && (c == d && d == a+b)){
            cout << "10-4" << "\n"; return;
        }
        if(a != b && (c == d && d == b-a && (2*b == 3*a))){
            cout << "10-4" << "\n"; return;
        }
        if(a == b && b == c && d == a+b+c){
            cout << "10-4" << "\n"; return;   
        }
    } while(next_permutation(v.begin(), v.end()));
    
    cout << "QAQ" << endl;
}
 
int main(){
    LL t; cin >> t;
    while(t --> 0) solve();
}
 
 

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED