func_code_string: #include <bits/stdc++.h>   using namespace std;   const double pi = acos(-1);   long long n, a[103][2601] = {}, ans = 0, mod = 1000000007, tmp = 0;   string second;   char c;   vector<pair<int, int> > vp;   bool first, f1;   bool cmpvp(pair<int, int> p1, pair<int, int> p2) {     if (p1.first < p2.first) return 1;     if (p1.first == p2.first)       if (p1.second < p2.second) return 1;     return 0;   }   int main() {     for (int i = 0; i < 26; ++i) a[1][i] = 1;     for (int i = 2; i <= 100; ++i) {       for (int j = 0; j <= 2600; ++j) {         for (int k = 0; k < 26; ++k)           a[i][j + k] = (a[i][j + k] + a[i - 1][j]) % mod;       }     }     cin >> n;     for (int i = 0; i < n; ++i) {       tmp = 0;       cin >> second;       for (int j = 0; second[j]; ++j) tmp += second[j] -  a ;       cout << a[second.size()][tmp] - 1 << endl;     }     return 0;   }   