HDU2082-找单词

#include <iostream>
#include <cstring>
#define MaxN 60
using namespace std;
int g[MaxN], G[MaxN], x[MaxN];

int main()
{
    int iCase;
    scanf("%d", &iCase);
    while (iCase--)
    {
        for (int i=1;i<27;++i) 
            scanf("%d", &x[i]);
        memset(g, 0, sizeof(g));
        memset(G, 0, sizeof(G));
        G[0] = 1;
        for (int i=1;i<=26;++i)
        {
            for (int j=0;j<=50;++j)
                for (int k=0; k<=x[i] && k*i+j<=50; ++k)
                {
                    g[k*i+j] += G[j];
                }
            memcpy(G, g, sizeof(g));
            memset(g, 0, sizeof(g));
        }
        int cnt = 0;
        for (int i=1;i<=50;++i) 
            cnt += G[i];
        printf("%d\n", cnt);
    }
    return 0;
}