HDUOJ 5651 xiaoxin juju needs help

集合的循环排列 A(n, m)/m
多重集的排列 C(n, n1)*C(n, n2)---C(n, nk) = n!/(n!*...nk!)
特殊(每个元素无限) 有k个不同的元素，S的r排列为k^r

#ifdef _DEBUG
#pragma warning(disable : 4996)
#endif
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define CLOSE() ios::sync_with_stdio(false)
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define PF(a) printf("%d\n", a)
#define SF(a) scanf("%d", &a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define MAXN 1005
#define MAXM 250005
#define MOD 1000000007
#define INF 1e18
using namespace std;
//-------------------------CHC------------------------------//
//HDUOJ 5651 xiaoxin juju needs help
//回文串，奇数个字母大于1则无解
LL qpow(LL a, LL b) {
	LL ret = 1;
	while (b) {
		if (b & 1) ret = ret * a %MOD;
		a = a*a%MOD;
		b >>= 1;
	}
	return ret;
}

LL f[MAXN];

void fun() {
	f[0] = 1;
	//0!的初始化不可少
	f[1] = 1;
	FOR(i, 2, 1005) {
		f[i] = (LL)i * f[i - 1], f[i] %= MOD;
		//printf("%lld\n", f[i]);
	}
}

char s[MAXN];
map<char, int> cnt;

int main() {
	int n;
	SF(n);
	fun();
	while (n--) {
		cnt.clear();
		scanf("%s", s);
		int len = strlen(s);
		if (len == 1) {
			printf("1\n");
			continue;
		}
		FOR(i, 0, len) cnt[s[i]]++;
		int res = 0;
		for (auto i : cnt) if (i.second & 1) res++;
		if (res > 1) {
			printf("0\n");
			continue;
		}
		LL sum = 0;
		for (auto &i : cnt) {
			//printf("ans = %lld\n", ans);
			i.second >>= 1;
			sum += i.second;
		}
		LL ans = f[sum];
		for (auto i : cnt) {
			ans *= qpow(f[i.second], MOD - 2);
			ans %= MOD;
		}
		printf("%lld\n", ans);
	}
	return 0;
}