zoj 2915 Dice Password Security

#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int len[60];long long dp[7][60];int main(){    int cas;    cin >> cas;    for(int t = 1;t <= cas;t++)    {        int m,n,q;        cin >> m >> n >> q;        memset(len,0,sizeof(len));        memset(dp,0,sizeof(dp));        for(int i = 0;i < m;i++)        { string s; cin >> s; len[s.length()]++;        }        for(int i = 0;i < 11;i++)        { dp[1][i] = len[i]; dp[i][i] = len[1];        }        for(int i =1;i < 6;i++) for(int k = 0;k < 11;k++)     for(int j = 0;j <= 51-k;j++)         dp[i+1][j+k] += dp[i][j] * len[k];        int l;        while (q--)        { cin >> l; cout << dp[n][l] << "n";        }    }    return 0;}