HDU 6034 Balala Power! —— Multi-University Training 1

　　Talented Mr.Tang has nn strings consisting of only lower case characters. He wants to charge them with Balala Power (he could change each character ranged from a to z into each number ranged from 0 to 25, but each two different characters should not be changed into the same number) so that he could calculate the sum of these strings as integers in base 2626 hilariously.

Mr.Tang wants you to maximize the summation. Notice that no string in this problem could have leading zeros except for string "0". It is guaranteed that at least one character does not appear at the beginning of any string.

The summation may be quite large, so you should output it in modulo 109+7109+7.

Input

　　The input contains multiple test cases.

Output

　　For each test case, the first line contains one positive integers nn, the number of strings. (1≤n≤100000)

　　Each of the next nn lines contains a string sisi consisting of only lower case letters. (1≤|si|≤100000,∑|si|≤1e6)e
OutputFor each test case, output " Case #xx: yy" in one line (without quotes), where xxindicates the case number starting from 11 and yy denotes the answer of corresponding case.

Sample Input

1
a
2
aa
bb
3
a
ba
abc

Sample Output

Case #1: 25
Case #2: 1323
Case #3: 18221

题目大意：用26个字母表示26进制数中的1~26，并且给你n个字符串，以26进制从字符串转化为数字，问这些数字之和最大能有多少（以十进制输出）。为保证数据正确，其中必存在至少一个字母是代表了0。

思路：模拟。首先每个字母代表的数未知，但由于每个字符在字符串的位置是已知的，我们就可以求出每个字母从26进制转化十进制时的“系数”（即像26^a1+26^a2+26^a3……的数），用数组存储26进制数，在求和时考虑进位，去掉必为0的字母，然后对按26进制数的大小对数组排序，最后就能够求和解出答案了。。。比赛的时候是用的字符串存26进制，理论上也是可以做的，但是因为进位的姿势不对（一边加一边进位，先全部加完再进位才是正确的）导致TLE/(ㄒoㄒ)/

代码

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<algorithm>
 #include<iomanip>
 #include<cmath>
 #define MOD 1000000007
 #define MAXN 100010
 using namespace std;
 long long num[][MAXN],w[];
 long long sum[];
 long long a[MAXN];
 int u;
 char ss[MAXN];
 bool vis[];
 bool cmp(int s, int t)
 {
     for(int i=u-;i>=;i--){
         if(num[s][i]!=num[t][i])
             return num[s][i]<num[t][i];
     }
     return ;
 }
 int main()
 {
     a[]=;
     for(int i=;i<MAXN-;i++)
         a[i]=*a[i-]%MOD;

     int n;
     int z=;
     while(~scanf("%d", &n))
     {
         u=;
         memset(num, , sizeof(num));
         memset(sum, , sizeof(sum));
         memset(vis,false,sizeof(vis));
         int wei,p;
         for(int i=;i<n;i++){
             scanf("%s", ss);
             int l=strlen(ss);
             if(l>)
                 vis[ss[]-'a']=true;

             for(int j=;j<l;j++){
                 p=ss[j]-'a';
                 wei=l--j;
                 num[p][l--j]++;
                 sum[p]+=a[wei];
                 sum[p]%=MOD;
             }
             u=max(u, l);
         }
         for(int i=;i<;i++){
             for(int j=;j<u;j++){
                 num[i][j+]=num[i][j+]+num[i][j]/;
                 num[i][j]=num[i][j]%;
             }
             while(num[i][u])
             {
                 num[i][u+]+=num[i][u]/;
                 num[i][u++]%=;
                 u++;
             }
             w[i]=i;
         }
         int cnt=-;
         sort(w, w+, cmp);
         for(int i=;i<;i++){
             if(!vis[w[i]]){
                    cnt=w[i];
                    break;
             }
         }
         //cout<<cnt<<endl;
         int res=,x=;
         for(int i=;i>=;i--){
             if(cnt!=w[i]){
                 res+=(long long)(x--)*sum[w[i]]%MOD;
                 res%=MOD;
             }

         }
         z=z+;
         printf("Case #%d: %lld\n",z,res);
     }
 }