Решение задачи N-значные числа - 2 с Acmp

#include <bits/stdc++.h>
 
using namespace std;
 
int main()
{
    int n;
    cin >> n;
    if(n == 1)
        cout << 10 << " " << 0;
    else
        if(n == 2)
            cout << 1 << " " << 22;
    else
        if(n == 3)
            cout << 6 << " " << 123;
    else
        if(n == 4)
            cout << 12 << " " << 1124;
    else
        if(n == 5)
            cout << 40 << " " << 11125;
    else
        if(n == 6)
            cout << 30 << " " << 111126;
    else
        if(n == 7)
            cout << 84 << " " << 1111127;
    else
        if(n == 8)
            cout << 224 << " " << 11111128;
    else
        if(n == 9)
            cout << 144 << " " << "111111129";
    else
        if(n == 10)
            cout << 45  << " "<< "1111111144";
    else
        if(n == 11)
            cout << 605  << " "<< "11111111136";
    else
        if(n == 12)
            cout << 495  << " "<< "111111112222";
    else
        if(n == 13)
            cout << 1170  << " "<<"1111111111137";
    else
        if(n == 14)
            cout << 1092  << " "<< "11111111111225";
    else
        if(n == 15)
            cout << 210  << " "<< "111111111111138";
    else
        if(n == 16)
            cout << 240  << " " << "1111111111111146";
    else
        if(n == 17)
            cout << 2448  << " " << "11111111111111139";
    else
        if(n == 18)
            cout << 4896  << " "<< "111111111111111234";
    else
        if(n == 19)
            cout << 15846  << " "<< "1111111111111111147";
    else
        if(n == 20)
            cout << 3420  << " " << "11111111111111111227";
    return 0;
}