Kertoma

input/code.cpp: In function 'int main()':
input/code.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     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>
using namespace std;
 
void countAppearance(int factorial, int *fingerprint){
    int digits[1000] = {1};
    for(int i = 2 ; i <= factorial ; i++){
        for(int k = 0 ; k < 1000 ; k++){
            digits[k] *= i;
        }
        for(int k = 0 ; k < 1000 ; k++) if(digits[k] > 9){
            digits[k+1] += digits[k]/10;
            digits[k] %= 10;
        }
    }
    int a = 0;
    for(a = 999 ; !digits[a] ; a--);
    a++;
    for (int j = 0;j<a;j++){
        fingerprint[digits[j]] += 1;
    }
}
 
double stirlingFormula(int n){
    double digits = 0;
        for (int i = 2; i <= n; i++)
            digits += log10(i);
    return floor(digits) + 1;
}
 
int main(){
    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};
 
    do{
        for(int i = 0; i <= 9; i++)
        fingerprint[i] = 0;
 
        countAppearance(n, &fingerprint[0]);
        n += 1;
        found = true;
        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);
}

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