hdu 4541 Ten Googol

http://acm.hdu.edu.cn/showproblem.php?pid=4541

打表找规律

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int t;
int n,m;
int a[25][25]={{4, 1, 2, 6, 10},{4, 0, 4, 5, 9},{6, 3, 7, 8, 40, 50, 60},{6, 11, 12, 20, 30, 80, 90},{3, 15, 16, 70}, {13,13, 14 ,18, 19 ,41 ,42 ,46 ,51 ,52 ,56 ,61 ,62 ,66}, {26,17 ,21 ,22 ,26 ,31 ,32 ,36 ,44 ,45 ,49 ,54 ,55 ,59 ,64 ,65 ,69 ,81 ,82 ,86 ,91 ,92 ,96, 101}};


int main()
{
    scanf("%d",&t);
    int cas=1;
    while(t--)
    {
        scanf("%d%d",&n,&m);
        printf("Case #%d: ",cas++);
        if(m>a[n-3][0])
        {
            printf("-1
");
        }
        else if(n==9&&m==23)
        {
            printf("10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
");
        }
        else if(n==9&&m==24)
        {
             printf("20000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
");
        }
        else if(n==9&&m==25)
        {
             printf("60000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
");
        }
        else if(n==9&&m==26)
        {
            printf("100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
");
        }
        else
        {
            printf("%d
",a[n-3][m]);
        }
    }
    return 0;
}