Summat

#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
 
using namespace std;
 
int n;
int b[5000];
int M[5000][100];
int c;
set<int> pivoted;
 
int asdfff;
 
int find_pivot(int i) {
	for (int a = 0; a < c; ++a) {
		if (M[a][i] != 0 && pivoted.find(a) == pivoted.end()) {
			if (M[a][i] != 1) {
				int bs = M[a][i];
				for (int k = 0; k < n; ++k) {
					M[a][k] /= bs;
				}
				b[a] /= bs;
			}
			pivoted.insert(a);
			return a;
		}
	}
	return -1;
}
 
void gauss() {
	for (int i = 0; i < n; ++i) {
		int pivot = find_pivot(i);
		if (pivot == -1) continue;
		for (int a = 0; a < c; ++a) {
			if (a != pivot && M[a][i] != 0) {
				int bs = M[a][i];
				for (int k = 0; k < n; ++k) {
					M[a][k] -= bs * M[pivot][k];
				}
				b[a] -= bs * b[pivot];
			}
		}
	}
}
 
int main()
{
	for(;;) ++asdfff;
	cin >> n;
	for (int i = 0; i < n*(n-1)/2; ++i) {
		cin >> b[i];
	}
	for (int i = 0; i < n; ++i) {
		for (int a = i + 1; a < n; ++a) {
			M[c][i] = 1;
			M[c][a] = 1;
			++c;
		}
	}
	gauss();
	for (auto x : pivoted) {
		cout << b[x];
		if (x != *pivoted.rbegin()) cout << " ";
	}
	cout << '\n';
}

Test 1

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED