Kertoma

input/code.cpp: In function 'int main()':
input/code.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     scanf("%d %d %d %d %d %d %d %d %d %d" , &zero, &first, &two, &three, &four, &five, &six, &seven, &eight, &nine);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include<stdio.h>
#include<iostream>
#include<cstring>
#include<math.h>
#include<chrono>
#include<vector>
using namespace std;
using namespace std::chrono;

#define DIVISOR 1000000000

vector<uint32_t> multiplyLargeNumber(uint32_t factor, vector<uint32_t> digits) {
    // Initialize carry
    uint64_t carry = 0;

    // One by one multiply n with
    // individual digits of res[]
    for(unsigned long int i = 0; i < digits.size(); i++) {
        uint64_t result = (uint64_t)digits[i] * (uint64_t)factor;
        result += carry;

        // Store last digit of 'prod' in res[]
        digits[i] = result % DIVISOR;

        // Put rest in carry
        carry = (result / DIVISOR);
    }

    // Put carry in res and increase result size
    while (carry) {
        digits.push_back(carry % DIVISOR);
        carry = (carry / DIVISOR);
    }

    return digits;
}

vector<uint32_t> analyzeLargeNumber(vector<uint32_t> digits) {
    vector<uint32_t> fingerprint(10, 0);

    uint32_t q = 1;
    uint32_t k = 0;

    for(unsigned int j = 0; j < digits.size() - 1; j++){
       k = digits[j];

       for(q = DIVISOR / 10; q > 0; q /= 10) {
           fingerprint[k / q] += 1;
           k %= q;
        }
    }

    k = digits[digits.size() - 1];

    q = DIVISOR / 10;

    // skip leading zeros
    while(k < q) q /= 10;

    for(; q > 0; q /= 10) {
        fingerprint[k / q] += 1;
        k %= q;
    }

    return fingerprint;
}

int main(){
    //uint32_t input[] = {42,25,24,16,15,16,21,14,17,16};

    uint32_t zero, first, two, three, four, five, six, seven, eight, nine;
    scanf("%d %d %d %d %d %d %d %d %d %d" , &zero, &first, &two, &three, &four, &five, &six, &seven, &eight, &nine);
    uint32_t input[] = {zero, first, two, three, four, five, six, seven, eight, nine};
    //auto start = high_resolution_clock::now();

    vector<uint32_t> digits = {1};

    unsigned int length = 0;
    for(int i = 0; i < 10; i++)
        length += input[i];

    length /= log10(DIVISOR);

    bool found = false;
    uint32_t n = 2;

    vector<uint32_t> fingerprint(10,0);

    do{
        digits = multiplyLargeNumber(n, digits);
        n += 1;

        if(digits.size() >= length){
            fingerprint = analyzeLargeNumber(digits);

            found = true;
            for(int i = 0; i <= 9; i++){
                found &= (fingerprint[i] == input[i]);
            }
        }
    }
    while(!found);

    printf("%d \n", n-1);

//    auto stop = high_resolution_clock::now();
//    auto duration = duration_cast<microseconds>(stop - start);
//    cout << "Time taken by function: "
//             << duration.count() << " microseconds" << endl;
}

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

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED