Kertoma

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

int main() {
	
	int num; int len = 0; long long unsigned int count = 1;
	vector<int> table;

	for (int i = 0; i <= 9; i++) {
		cin >> num;
		len += num;
		table.push_back(num);
	}

	if (len == 1) {
		if (*max_element(table.begin(), table.end()) == 1) cout << 1;
		else if (*max_element(table.begin(), table.end()) == 2) cout << 2;
		else if (*max_element(table.begin(), table.end()) == 6) cout << 3;
	}
	else if (len == 3) {
		if (table[7] == 1) cout << 6;
		else cout << 5;
	}

	else {
		num = 2;
		while ((trunc(log10(count)) + 1) < len) {
			count = count * num;
			num++;
		}

		cout << num-1;
	}

	return 0;
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 1, 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

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED