Function main

project_euler_problems/digit factorials/solution.cpp:14–32

int is_factorion(int n, int *factorial_array);

int main(int argc, char **argv) {
    
    int *factorial_array = array_of_factorials();

    int result = 0;

    int i = 3;
    while(i < (log10(i) + 1) * *(factorial_array + 9)) {
        if(is_factorion(i, factorial_array)) result += i;
        ++i;
    }

    printf("The sum of all factorions in base 10 = %d\n", result);

    free(factorial_array);
    factorial_array = NULL;

    return 0;
}

int factorial(int n) {