| Task: | Kertoma | 
| Sender: | Parodontax | 
| Submission time: | 2022-11-01 10:37:21 +0200 | 
| Language: | C++ (C++11) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | TIME LIMIT EXCEEDED | 0 | 
| #2 | TIME LIMIT EXCEEDED | 0 | 
| #3 | TIME LIMIT EXCEEDED | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details | 
| #2 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details | 
| #3 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details | 
| #4 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details | 
| #5 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details | 
| #6 | TIME LIMIT EXCEEDED | -- | 1, 2, 3 | details | 
| #7 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #8 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #9 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #10 | TIME LIMIT EXCEEDED | -- | 2, 3 | details | 
| #11 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #12 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #13 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #14 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #16 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Code
#include <bits/stdc++.h>
using namespace std;
int multiply(int x, int res[], int res_size)
{
    int c = 0;
    for (int i = 0; i < res_size; i++) {
        int prod = res[i] * x + c;
 
        res[i] = prod % 10;
 
        c = prod / 10;
    }
 
    while (c) {
        res[res_size] = c % 10;
        c = c / 10;
        res_size++;
    }
    return res_size;
}
bool checkArray(int array[])
{
    for (int i = 0; i < 10; i++)
    {
        if (array[i] != 0)
        {
            return false;
        }
    }
    return true;
}
int main()
{
    int a[10];
    int b[10];
    int v;
    for (int i = 0; i < 10; i++)
    {
        cin >> v;
        a[i] = v;
        b[i] = v;
    }
    bool m = true;
    while (m) {
        int res[10000000];
    
        res[0] = 1;
        int res_size = 1;
    
        int x = 2;
        while (true)
        {
            res_size = multiply(x, res, res_size);
            x++;
        }
        
        for (int i = res_size - 1; i >= 0; i--)
        {
            int g = res[i];
            b[g] -= 1;
            if (checkArray(b))
            {
                break;
            }
        }
        if (checkArray(b))
        {
            for (int i = res_size - 1; i >= 0; i--)
            {
                cout << res[i];
            }
        }
        for (int i = 0; i < 10; i++)
        {
            b[i] = a[i];
        }
    }
}
Test details
Test 1
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 0 0 1 0 0 0 0 0 0 0 | 
| correct output | 
|---|
| 2 | 
| user output | 
|---|
| (empty) | 
Test 2
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 0 0 0 0 0 0 1 0 0 0 | 
| correct output | 
|---|
| 3 | 
| user output | 
|---|
| (empty) | 
Test 3
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 0 0 1 0 1 0 0 0 0 0 | 
| correct output | 
|---|
| 4 | 
| user output | 
|---|
| (empty) | 
Test 4
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 2 0 1 1 0 0 1 0 2 0 | 
| correct output | 
|---|
| 10 | 
| user output | 
|---|
| (empty) | 
Test 5
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 9 3 1 1 2 2 3 1 6 1 | 
| correct output | 
|---|
| 27 | 
| user output | 
|---|
| (empty) | 
Test 6
Group: 1, 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 10 4 3 4 3 2 2 4 3 7 | 
| correct output | 
|---|
| 36 | 
| user output | 
|---|
| (empty) | 
Test 7
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 71 53 36 30 25 29 42 24 34 29 | 
| correct output | 
|---|
| 199 | 
| user output | 
|---|
| (empty) | 
Test 8
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 71 33 46 38 27 45 36 21 35 35 | 
| correct output | 
|---|
| 205 | 
| user output | 
|---|
| (empty) | 
Test 9
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 93 38 35 26 43 54 38 25 41 34 | 
| correct output | 
|---|
| 222 | 
| user output | 
|---|
| (empty) | 
Test 10
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 33 33 45 36 43 38 54 56 36 | 
| correct output | 
|---|
| 242 | 
| user output | 
|---|
| (empty) | 
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 3419 1797 1845 1849 1879 1791 ... | 
| correct output | 
|---|
| 5959 | 
| user output | 
|---|
| (empty) | 
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 4776 2695 2709 2781 2616 2753 ... | 
| correct output | 
|---|
| 8391 | 
| user output | 
|---|
| (empty) | 
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 20097 12282 12229 12214 12406 ... | 
| correct output | 
|---|
| 32001 | 
| user output | 
|---|
| (empty) | 
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 47934 29918 29878 29713 29984 ... | 
| correct output | 
|---|
| 71718 | 
| user output | 
|---|
| (empty) | 
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 84691 54156 54277 54533 54296 ... | 
| correct output | 
|---|
| 123123 | 
| user output | 
|---|
| (empty) | 
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 99098 63339 63878 64182 63904 ... | 
| correct output | 
|---|
| 142663 | 
| user output | 
|---|
| (empty) | 
