Summat

input/code.cpp: In function 'std::vector<int> lol(std::vector<int>)':
input/code.cpp:13:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<a.size(); i++) {
               ~^~~~~~~~~
input/code.cpp: In function 'std::vector<int> lol2(std::vector<int>*, int)':
input/code.cpp:38:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<b->size(); i++)
               ~^~~~~~~~~~
input/code.cpp:53:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<b->size(); i++) {
               ~^~~~~~~~~~
input/code.cpp:57:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=i; j<b->size(); j++) {
                ~^~~~~~~~~~
input/code.cpp:63:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(pnt==a.size())
       ~~~^~~~~~~~~~
input/code.cpp: In function '...

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define M 1000000007

using namespace std;

vector<int> lol(vector<int> a) {
	vector<tuple<int,int,int>> b;
	vector<int> bb;
	sort(a.begin(), a.end());
	for(int i=0; i<a.size(); i++) {
		for(int j=0; j<i; j++) {
			b.push_back(make_tuple(a[i]+a[j], min(i, j), max(i, j)));
			bb.push_back(a[i]+a[j]);
		}
	}
	sort(b.begin(), b.end());
/*for(auto u:a)
		cout << u << " ";
	cout << endl;
	for(auto u:b) {
		cout << get<0>(u) << " " << get<1>(u) << " " << get<2>(u) << " ";
		if(a[get<1>(u)] == a[get<1>(b[0])])
			cout << "x";
		cout << "\n";*/
	//	cout << get<0>(u) << " ";
	//	}*/

//	cout << endl;
	sort(bb.begin(), bb.end());
	return bb;
}

int z[1010101];
vector<int> lol2(vector<int> *b, int pienin) {
	for(int i=0; i<b->size(); i++)
		z[i] = 0;
	//int pienin = b[0]/2;
	vector<int> a;
	/*for(auto u:b) {
		if(u != ed) {
			pienin = u-b[0];
			break;
		}
	}*/
	a.push_back(pienin);
	a.push_back((*b)[0]-pienin);
//	cout << a[0] << " ja " << a[1] << endl;
	z[0] = 1;
	int cnt = 1;
	for(int i=0; i<b->size(); i++) {
		if(z[i])
			continue;
		int pnt=0;
		for(int j=i; j<b->size(); j++) {
			if(z[j] || (*b)[j] != (((*b)[i]-pienin)+a[pnt]))
				continue;
			pnt++;
			z[j] = 1;
			cnt++;
			if(pnt==a.size())
				break;
		}
		a.push_back((*b)[i]-pienin);
	}

	return a;
}

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int sd = time(NULL);
	srand(sd);
	int n;
	cin >> n;
	vector<int> A;
	int f;
	for(int i=0; i<(n*(n-1))/2; i++) {
		cin >> f;
		A.push_back(f);
	}
	sort(A.begin(),A.end());
	for(int i=0; i<101; i++) {
		vector<int> ans = lol2(&A, (A[0]+A[1]-A[i])/2);
		if(ans.size() == n) {
			for(auto u:ans)
				cout << u << " ";
			return 0;
		}
	}

//		lol(lol2(lol(v), i));
	//lol(v);
	//lol({1,2,3,4,5});
	//lol(lol2({4,4,4,6,6,6}, 1));
}

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: ACCEPTED

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: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED