参考了别人的暴力代码 自己的错误在与 思路并不复杂 但是自己的map并没有请空 这个错误 要改

#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<queue>
using namespace std;
#define N  501
map<char, int> m;
map<char, int>::iterator it;
long long gcd(long a, long long b)
{
return b == 0 ? a : gcd(b, a%b);
}
char a[1001];
queue<int> q;
long long b[1000];
long long ans;
int main()
{
int t;
int sum;
int z;
scanf("%d", &t);
while (t--)
{
sum = 0;
while (!q.empty())q.pop();
scanf("%s", a);
int l = strlen(a);
m.clear();
for (int i = 0; i < l; i++)
{
m[a[i]]++;
}
for (it = m.begin(); it != m.end(); it++)
{
if (it->second % 2)sum++;
it->second /= 2;
}
if (sum >= 2)  {
printf("0\n"); continue;
}
for (it = m.begin(); it != m.end(); it++)
{
if (it->second >= 2)
{
for (int j = it->second; j >= 2; j--)
{
q.push(j);
}
}
}
for (int i = 1; i <= l / 2; i++)
{
b[i] = i;
}

while (!q.empty())
{
int x = q.front();
q.pop();
for (int i = 2; i <= l / 2; i++)
{

if (b[i] % x == 0)
{
b[i] /= x;
break;
}
else
{
int y = gcd(b[i], x);
if (y>1)
{
b[i] /= y;
x /= y;
if (x>1)q.push(x);
break;
}

}
}
}
ans = 1;
for (int i = 2; i <= l / 2; i++)
{
ans *= b[i];
ans %= 1000000007;
}
cout << ans << endl;
}
return 0;
}