Kasat

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(int argc, char** argv) {
    int t;
    long a, b, c, n;
    cin >> t;
    vector<vector<long> > v;
    for (int i = 0; i < t; ++i){
        vector<long> vv;
        cin >> a >> b >> c >> n;
        long kasat[3] = {a, b, c};
        sort(kasat, kasat+3);
        long x = n > (kasat[1] - kasat[0]) ? (kasat[1] - kasat[0]) : n;
        kasat[0] += x;
        kasat[2] -= x;
        n -= x;
        if (n > 0){
            if (n >= 2*(kasat[2] - kasat[0])/3) { 
                x = (kasat[2] - kasat[0]);
                kasat[0] += x/3;
                kasat[1] = kasat[0] + (x%3)/2;
                kasat[2] = kasat[0] + x%3 - (x%3)/2;
                if (kasat[0] == kasat[1] && kasat[0] == kasat[2]) {
                    n -= 2*(kasat[2] - kasat[0])/3;
                    kasat[0] -= n%2; kasat[2] += n%2;
                }
            } else {
                kasat[0] += n/2;
                kasat[1] += n/2 + n%2;
                kasat[2] -= n;
            }
        }
        for (int j = 0; j < 3; ++j) vv.push_back(kasat[j]);
        v.push_back(vv);
    }
    for (int i = 0; i < t; ++i){
        cout << v.at(i).at(0) << " " << v.at(i).at(1) << " " << v.at(i).at(2) << "\n";
    }
    return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER