Summat

#include <algorithm>
#include <iostream>

using namespace std;

bool check(int *out, int *in, int n) {
	int tmp[5000];
	int c = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = i + 1; j < n; ++j) {
			tmp[c] = out[i] + out[j];
			++c;
		}
	}
	int tmp2[5000];
	copy(in, in+c, tmp2);
	sort(tmp2, tmp2+c);
	sort(tmp, tmp+c);
	return equal(tmp, tmp + c, tmp2);
}

int main()
{
	int n;
	cin >> n;
	int in[5000];
	for (int i = 0; i < n*(n-1)/2; ++i) {
		cin >> in[i];
	}
	sort(in, in+n*(n-1)/2);
	int out[1000];
	do {
		if ((in[0] - in[1] + in[n-1]) % 2 != 0) continue;
		out[1] = (in[0] - in[1] + in[n-1]) / 2; 
		out[0] = in[0] - out[1]; 
		if (out[1] <= 0 || out[0] <= 0) continue;
		bool good = true;
		for (int i = 1; i < n - 1; ++i) {
			if (in[i] - out[0] <= 0) {
				good = false;
				break;
			}
			out[i+1] = in[i] - out[0]; 
		}
		if (!good) continue;
		if (check(out, in, n)) break;
	} while(next_permutation(in, in+n*(n-1)/2));
	for (int i = 0; i < n - 1; ++i) {
        	cout << out[i] << " "; 
	}
	cout << out[n-1] << endl;
}

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: TIME LIMIT EXCEEDED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED