| Task: | Kertoma | 
| Sender: | snowflake | 
| Submission time: | 2022-11-02 18:43:45 +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 | ACCEPTED | 0.00 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.00 s | 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 | WRONG ANSWER | 0.00 s | 3 | details | 
| #14 | WRONG ANSWER | 0.00 s | 3 | details | 
| #15 | WRONG ANSWER | 0.00 s | 3 | details | 
| #16 | WRONG ANSWER | 0.00 s | 3 | details | 
Code
#include<iostream>
using namespace std;
int master[30000];
void fac(int num)
{
    std::fill_n(master, 0, 0);
    master[0] = 1;
    int inn = 1;
    for (int i = 2; i <= num; i++)
    {
        int nextround = 0;
        for (int i2 = 0; i2 < inn; i2++)
        {
            int product = master[i2] * i + nextround;
            master[i2] = product % 10;
            nextround = product * 0.1;
        }
        while (nextround > 0)
        {
            master[inn] = nextround % 10;
            nextround = nextround * 0.1;
            inn++;
        }
    }
}
int main()
{
    int nil, one, two, three, four, five, six, seven, eight, nine;
    cin >> nil >> one >> two >> three >> four >> five >> six >> seven >> eight >> nine;
    int numz[] = { nil, one, two, three, four, five, six, seven, eight, nine };
    int wa = 0;
    int kick = two * 2.5;
    for (int e = kick; e <= 30000; e++)
    {
        fac(e);
        int counters[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
        for (int z = 0; z < 30000; z++)
        {
            counters[master[z]]++;
        }
        int z0 = counters[0];
        counters[0] = 30000 - z0 - 1;
        bool spill = false;
        for (int k = 0; k < 10; k++)
        {
            spill = counters[k] != numz[k];
            if (spill)
                break;
        }
        if (!spill)
        {
            wa = e;
            break;
        }
    }
    cout << wa;
    return 0;
}Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 0 0 1 0 0 0 0 0 0 0 | 
| correct output | 
|---|
| 2 | 
| user output | 
|---|
| 2 | 
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 0 0 0 0 0 0 1 0 0 0 | 
| correct output | 
|---|
| 3 | 
| user output | 
|---|
| 3 | 
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: WRONG ANSWER
| input | 
|---|
| 20097 12282 12229 12214 12406 ... | 
| correct output | 
|---|
| 32001 | 
| user output | 
|---|
| 0 | 
Test 14
Group: 3
Verdict: WRONG ANSWER
| input | 
|---|
| 47934 29918 29878 29713 29984 ... | 
| correct output | 
|---|
| 71718 | 
| user output | 
|---|
| 0 | 
Test 15
Group: 3
Verdict: WRONG ANSWER
| input | 
|---|
| 84691 54156 54277 54533 54296 ... | 
| correct output | 
|---|
| 123123 | 
| user output | 
|---|
| 0 | 
Test 16
Group: 3
Verdict: WRONG ANSWER
| input | 
|---|
| 99098 63339 63878 64182 63904 ... | 
| correct output | 
|---|
| 142663 | 
| user output | 
|---|
| 0 | 
