Summat

import java.util.*;
 
public class summat {
 
	private static int[] findAnswer(int[] arr, List<Integer> eList, int aqty, int maxsum, int round) {
 
		int[] storeArr = new int[round-1];
 
		if (round > aqty) {
			arr[aqty] = 0;
			return arr;
		}
 
		if (arr[aqty] == 1) return arr;
 
		List<Integer> dList = new ArrayList<>(eList);
		boolean okAns = false;
 
		for (int kn = 1; kn < maxsum; kn++) {
 
			dList = new ArrayList<>(eList);
			boolean ok = true;
 
			for (int i = 0; i < (round-1); i++) {
				if (!dList.contains(kn+arr[i])) {
					ok = false;
				}
			}
 
			if (ok) {
 
			  for (int i = 0; i < (round-1); i++) {
				if (dList.contains(kn+arr[i])) {
 
					storeArr[i] = kn+arr[i];
					dList.remove(Integer.valueOf(kn+arr[i]));	
 
				}
				else {
					ok = false;
				}
			  }
 
 
			}
 
			if (ok) {
 
				arr[round-1] = kn;
 
				if (round == aqty) {
					arr[round] = 1;
					okAns = true;
					return arr;
				}
 
				arr = findAnswer(arr, dList, aqty, maxsum, round+1);
 
				if (arr[aqty] > 0) {break;}
 
//				dList = new ArrayList<>(eList);
				for (int i = 0; i < (round-1); i++) {
					dList.add(storeArr[i]);
				}
			}
 
			else {
				dList = new ArrayList<>(eList);
			}
		}
 
		return arr;
 
	}
 
 
 
	public static void main(String[] args) {
 
		Scanner input = new Scanner(System.in);
 
		int aqty = input.nextInt();
		int bqty = aqty * (aqty - 1) / 2;
 
		int[] b = new int[bqty];
		int[] c = new int[bqty];
		int[] ans = new int[aqty+1];
 
		for (int i = 0; i < bqty; i++) {
			b[i] = input.nextInt();
		}
 
		Arrays.sort(b);
 
		List<Integer> cList = new ArrayList<Integer>(b.length);
		for (int i : b) {
			cList.add(i);
			}
 
		int maxsum = b[bqty-1];
 
		int allOk = 0;
		List<Integer> dList = new ArrayList<>(cList);
 
		for (int k1 = 1; k1 < maxsum; k1++) {
			
			if (allOk > 0) break;
 
			ans[0] = k1;
 
			for (int k2 = 1; k2 < maxsum; k2++) {
 
				if (dList.contains(k1+k2)) {
 
					ans[1] = k2;
					dList.remove(Integer.valueOf(k1+k2));
 
					ans = findAnswer(ans, dList, aqty, maxsum, 3);
 
					if (ans[aqty] > 0) {
						allOk = 1;
						break;
						}
					else {
						dList.add(k1+k2);
					}
				}
			}
		}
 
 
		for (int i = 0; i < (aqty-1); i++) {
 
			System.out.print(ans[i] + " ");
		}
		System.out.println(ans[aqty-1]);
		input.close(); 
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED