Kertoma

input/code.cpp: In function 'std::vector<int> countAppearance(int, std::vector<int>)':
input/code.cpp:17:28: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (long int i = 0; i < digits.size(); i++) {
      |                          ~~^~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     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;

vector<int> countAppearance(int factor, vector<int> digits){
    //int length = digits.size();
    // Initialize carry
    long int carry = 0;

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

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

        // Put rest in carry
        carry = result / 10;
    }

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

int main(){
    //auto start = high_resolution_clock::now();
    bool found = true;
    //int input[] = {1, 1, 1, 0, 0, 0, 0, 0, 0, 0};
    //int input[] = {42,25,24,16,15,16,21,14,17,16};
    int n = 2;
    int fingerprint[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};

    int 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);
    int input[] = {zero, first, two, three, four, five, six, seven, eight, nine};
    vector<int> digits = {1};

    do{
        for(int i = 0; i <= 9; i++)
        fingerprint[i] = 0;

        digits = countAppearance(n, digits);
        n += 1;
        found = true;

        for (unsigned int j = 0 ; j<digits.size() ; j++){
            fingerprint[digits[j]] += 1;
        }
        for(int i = 0; i <= 9; i++){
            //printf("%d %d\n", fingerprint[i], input[i]);
            found &= (fingerprint[i] == input[i]);

            //printf("%d\n", fingerprint[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: 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