Kertoma

input/code.cpp: In function 'void mult(ll, ll)':
input/code.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0; i < xsize || c; i++) {
      |                     ~~^~~~~~~
input/code.cpp:19:15: warning: comparison of integer expressions of different signedness: 'int' and 'll' {aka 'long long unsigned int'} [-Wsign-compare]
   19 |         if (i == xsize) {
      |             ~~^~~~~~~~

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

using namespace std;

typedef unsigned long long ll;

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

void mult(ll t, ll y) {
    const ll base = 1e9;
    ll xsize = f[t].size();
    f[t + 1].resize(xsize);

    ll c = 0;
    for (int i = 0; i < xsize || c; i++) {
        if (i == xsize) {
            f[t].push_back(0);
            f[t + 1].push_back(0);
        }
        ll summi = f[t][i] * y + c;
        c = summi / base;
        f[t + 1][i] = summi - base * c;
    }
    /*while (f[t + 1].size() > 1 && f[t + 1].back() == 0) {
        f[t + 1].pop_back();
    } */
}

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++) {
            mult(i - 1, i);
        }
    }
}

ll len(ll x) {
    ll ans = 0;
    for (int i = f[x].size() - 2; i >= 0; i--) {
        ans += 9;
    }
    ll a = f[x][f[x].size() - 1];
    while (a > 0) {
        a /= 10;
        ans++;
    }
    return ans;
}

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);
    }
    fact(10000);
    if (dig <= 356603) {
        ll L = 1;
        ll R = 10000;
        while (R - L > 1) {
            ll M = (L + R) / 2;
            fact(M);
            if (len(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 {
        ll d = 1000 + (dig - 2568) / 4;
        cout << d;
    }
}

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

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: WRONG ANSWER