HDU - 5651 xiaoxin juju needs help 逆元模板

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

题意：生成回文串。输出所有回文串的可能数。

题解：mod除法会损失高位，用逆元来代替除法，模板如下

ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<string>

using namespace std;
const int maxn = ;
int num[maxn];
//char s[maxn];
typedef long long ll;
const int mod = 1e9 + ;
ll f[maxn];
void init() {
    f[] = ; f[] = ;
    for (int i = ; i < maxn; i++)
        f[i] = f[i - ] * i%mod;
}
ll cal(ll x) {
    ll res = ;
    int k = mod - ;
    while (k) {
        if (k & ) {
            res *= x;
            res %= mod;
        }
        x*=x;
        x %= mod;
        k >>= ;
    }
    return res;//cal(x^ mod)
}
int main() {
    int t;
    init();
    cin >> t;
    while (t--) {
        memset(num, , sizeof(num));
        string s;
        cin >> s;
        int n = s.length();

        for (int i = ; i < n; i++) {
            num[s[i]]++;

        }
        int cnt = ;
        for (int i = 'a'; i <= 'z'; i++) {
            if (num[i] & ) cnt++;
        }
        if (cnt > ) {
            cout <<  << endl; continue;
        }
        int sum = ;
        for (int i = 'a'; i <= 'z'; i++) {
            num[i] /= ;
            sum += num[i];
        }
        ll res = f[sum];
        for (int i ='a'; i <='z'; i++)if(num[i]) {
            res = res*cal(f[num[i]]) % mod;
        }
        cout << res<<endl;

    }
}