Kertoma

input/code.cpp: In function 'std::vector<int> mult(std::vector<int>, std::vector<int>)':
input/code.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for (int i = 0; i < x.size(); i++) {
      |                     ~~^~~~~~~~~~
input/code.cpp:16:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         for (int j = 0; j < y.size(); j++) {
      |                         ~~^~~~~~~~~~

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

using namespace std;

typedef unsigned long long ll;

vector<int> mult(vector<int> x, vector<int> y) {
    //reverse(x.begin(), x.end());
    //reverse(y.begin(), y.end());
    vector<int> ans(x.size() + y.size() + 2, 0);

    for (int i = 0; i < x.size(); i++) {
        for (int j = 0; j < y.size(); j++) {
            int summi = x[i] * y[j];
            ans[i + j] += summi;
            ans[i + j + 1] += (ans[i + j] / 10);
            ans[i + j] %= 10;
        }
    }
    while (ans.size() > 1 && ans.back() == 0) {
        ans.pop_back();
    }
    //reverse(ans.begin(), ans.end());
    return ans;
}

vector<int> make_arr(ll x) {
    vector<int> ans;
    while (x > 0) {
        ans.push_back(x % 10);
        x /= 10;
    }
    //reverse(ans.begin(), ans.end());
    return ans;
}

vector<vector<int>> f(10000, {0});

void fact(ll x) {
    f[0] = {1};
    if (f[x][0] == 0) {
        ll start = x;
        while (f[start][0] == 0) {
            start--;
        }
        for (ll i = start + 1; i <= x; i++) {
            f[i] = mult(f[i - 1], make_arr(i));
        }
    }
}

ll len(vector<int> num) {
    return num.size();
}

int main() {
    vector<ll> cnt(10);
    ll dig = 0;
    ll sum = 0;
    for (int i = 0; i < 10; i++) {
        cin >> cnt[i];
        dig += cnt[i];
        sum += (cnt[i] * i);
    }
    if (dig <= 158) {
        ll L = 1;
        ll R = 100;
        while (R - L > 1) {
            ll M = (L + R) / 2;
            fact(M);
            if (len(f[M]) < dig) {
                L = M;
            } else {
                R = M;
            }
        }
        if (R == 5 || R == 6) {
            if (sum == 3) {
                cout << 5;
            } else {
                cout << 6;
            }
        } else if (R == 2 || R == 3) {
            if (sum == 2) {
                cout << 2;
            } else {
                cout << 3;
            }
        } else {
            cout << R;
        }
    } else if (dig <= 2568) {
        ll L = 100;
        ll R = 1000;
        while (R - L > 1) {
            ll M = (L + R) / 2;
            fact(M);
            if (len(f[M]) < dig) {
                L = M;
            } else {
                R = M;
            }
        }
        cout << R;
    } else {
        ll L = 1000;
        ll R = 4000;
        while (R - L > 1) {
            ll M = (L + R) / 2;
            fact(M);
            if (len(f[M]) < dig) {
                L = M;
            } else {
                R = M;
            }
        }
        cout << R;
    }
}

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