As we all known, xiaoxin is a brilliant coder. He knew **palindromic** strings when he was only a six grade student at elementry school.
This summer he was working at Tencent as an intern. One day his leader came to ask xiaoxin for help. His leader gave him a string and he wanted xiaoxin to generate palindromic strings for him. Once xiaoxin generates a different palindromic string, his leader will give him a watermelon candy. The problem is how many candies xiaoxin's leader needs to buy?
题意:给你一个字符串,求打乱字符后,有多少种回文串
挺好的一道题,来讲个规律吧,(a+b+c+d+...z)的阶乘==C(a+b+c....+y+z,a+b+c+d+...y)*C(a+b+c+d+......+x+y,a+b+c+d+....+x),*....C(a+b,a);
根据(a+b)!=C(a+b,a)推出来的,那么题目可以转换成,已知有m个字母,每个字母有不同的个数,问排列起来有多少种排列方式,就用到了上边的公式,因为题目所用的数据比较大,所以求组合数的函数不能用,需要用到杨辉三角,杨辉三角和组合数的过程是一样的,那么便得到了答案
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include <string.h>
#include <math.h>
#define ll long long
using namespace std;
int c[2010][2010];//用来计算组合数
int main()
{
//freopen("in.txt","r",stdin);
int t,i,l;
char str[1005];//存放传入的字符床
memset(c,0,sizeof(c));//初始化
c[0][0]=1;
for(i=1; i<=510; i++)
{
c[i][0]=1;//所有这种0的组合数都为一
for(int j=1; j<510; j++)
{
c[i][j]=(c[i-1][j]+c[i-1][j-1])%1000000007;//杨辉三角来求(可以自行查杨辉三角与组合数的关系)
}
}
scanf("%d",&t);
while(t--)
{
scanf("%s",str);
l=strlen(str);
int hh[30];//将字符转化位数字,下标代表类型,出现次数存放
memset(hh,0,sizeof(hh));//初始化
for(i=0; i<l; i++)
{
hh[str[i]-'a']++;//统计出现次数
}
int pd=0;//计算有出现奇数次的字符
for(i=0; i<26; i++)
{
if(hh[i]%2!=0)
{
pd++;
}
}
if(l%2==0)//总共偶数个字符的话
{
if(pd>0)
{
printf("0\n");
}
else
{
l=l/2;//因为是回文串,只看一半即可
ll sum=1;
for(i=0; i<26; i++)
{
if(hh[i])//如果这个字符出现了
{
hh[i]/=2;
sum=(c[l][hh[i]]%1000000007)*(sum%1000000007);//对我们规律的应用
sum%=1000000007;
l=l-hh[i];
}
}
printf("%I64d\n",sum);
}
}
else//总共奇数个字符的话
{
if(pd>1)
{
printf("0\n");
}
else if(pd==1)
{
l=l/2;
ll sum=1;
for(i=0; i<26; i++)
{
if(hh[i])
{
hh[i]/=2;
sum=(c[l][hh[i]]%1000000007)*(sum%1000000007);//应用规律
sum%=1000000007;
l=l-hh[i];
}
}
printf("%I64d\n",sum);
}
}
}
return 0;
}