Kertoma

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

using namespace std;

int factorial(int n)
{
    int result = 1;
    for (int i = 2; i <= n; i++)
        result *= i;
    return result;
}

// This function returns the number of times a given digit appears in a number
int countDigit(int num, int digit)
{
    int count = 0;
    while (num > 0)
    {
        if (num % 10 == digit)
            count++;
        num /= 10;
    }
    return count;
}

// This function checks if the number of times each digit appears in the given factorial matches the given counts
bool checkFactorial(int factorial, vector<int> counts)
{
    for (int i = 0; i < 10; i++)
        if (countDigit(factorial, i) != counts[i])
            return false;
    return true;
}

int main()
{
    // Read the number of times each digit appears in the factorial
    vector<int> counts(10);
    for (int i = 0; i < 10; i++)
        cin >> counts[i];

    // Start with the minimum possible value for x (x = 2)
    // and keep incrementing it until we find a factorial that matches the given counts
    int x = 2;
    while (true)
    {
        int factoria = factorial(x);
        if (checkFactorial(factoria, counts))
        {
            cout << x << endl;
            return 0;
        }
        x++;
    }
}

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