Kasat

//package putka.pkg3.pkg1;
 
import java.util.Arrays;
import java.util.Scanner;
 
/**
 *
 * @author Adreno
 */
public class Putka31 {
 
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int t = input.nextInt();
        long[] abc = new long[3];
        for (int i=0; i<t; i++) {
            abc[0] = input.nextLong();
            abc[1] = input.nextLong();
            abc[2] = input.nextLong();
            long n = input.nextLong();
            System.out.println(pelaa(abc, n));
        }
    }
 
    private static String pelaa(long[] abc, long n) {
        while (n > 0) {
            sort(abc);
            //System.out.println(Arrays.toString(abc));
            if (abc[0] == abc[1] && abc[1] >= (abc[2] - 1)) break;
            if ((abc[0]+1) >= abc[1] && abc[1] == abc[2]) break;
            long moves = Math.min(abc[2] - abc[0], abc[2] - abc[1]);
            moves = Math.min(abc[1] - abc[0], moves);
            moves = Math.min(n, moves);
            if (moves > 0) {
                abc[0] = abc[0] += moves;
                abc[2] = abc[2] -= moves;
            } else {
                long diff = abc[2] - abc[0];
                moves = (abc[2] - abc[0]) * 66 / 100;
                moves = Math.min(moves, n);
                if (abc[1] < abc[0]) {
                    // case 388
                    abc[0] += moves;
                    abc[1] -= moves/2;
                    abc[2] -= moves/2;
                    if ((moves/2)*2 < moves) abc[2]--;
                } else {
                    // case 338
                    //System.out.println("moves=" +moves + ", moves/2=" + (moves/2));
                    abc[2] -= moves;
                    abc[1] += moves/2;
                    abc[0] += moves/2;
                    if ((moves/2)*2 < moves) abc[0]++;
                }
            }
            n -= moves;
        }
        
        // a==b==c
        if (abc[0] == abc[1] && abc[1] == abc[2]) {
            if (n % 2 != 0) {
                abc[0]++;
                abc[2]--;
                sort(abc);
            }
            return abc[0] + " " + abc[1] + " " + abc[2];
        }
        // a==b==(c-1)
        sort(abc);
        return abc[0] + " " + abc[1] + " " + abc[2];
    }
    
    private static void sort(long[] t) {
        if (t[1] < t[0]) {
            long apu = t[0];
            t[0] = t[1];
            t[1] = apu;
        }
        if (t[2] < t[1]) {
            long apu = t[1];
            t[1] = t[2];
            t[2] = apu;
        }
        if (t[1] < t[0]) {
            long apu = t[0];
            t[0] = t[1];
            t[1] = apu;
        }
    }
    
    
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: WRONG ANSWER