Kasat

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

int main(){
  int t;std::cin>>t;
  for(int a,b,c,n;std::cin>>a>>b>>c>>n;){
    std::vector<int>X{a,b,c};
    while(n){
      std::sort(X.begin(),X.end());
      if(n<10)--X[2],++X[0],--n;
      else if(X[2]-X[0]>1){
        if(X[0]==X[1]){
          int d=std::min((X[2]-X[1]+2)/3,n);
          n-=d;
          X[0]+=d/2;
          X[1]+=(d+1)/2;
          X[2]-=d;
        }
        else if(X[1]==X[2]){
          int d=X[1]-X[0]==2?1:(X[1]-X[0]+2)/2;
          d=std::min(d,n);
          n-=d;
          X[0]+=d;
          X[1]-=d/2;
          X[2]-=(d+1)/2;
        }
        else{
          int d=std::min(std::min(X[1]-X[0],X[2]-X[1]),n);
          n-=d;
          X[0]+=d;
          X[2]-=d;
        }
      }
      else if(X[0]==X[2])n%=2;
      else n=0;
    }
    std::sort(X.begin(),X.end());
    std::cout<<X[0]<<' '<<X[1]<<' '<<X[2]<<'\n';
  }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED