BZOJ1072: [SCOI2007]排列perm

#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;

int f[1024][1000];
int s[11];

char c;
inline void read(int &a)
{
a=0;do c=getchar();while(c<'0'||c>'9');
while(c<='9'&&c>='0')a=(a<<3)+(a<<1)+c-'0',c=getchar();
}
int cnt[11];
int F[]={1,1,2,6,24,120,720,5040,40320,362880,3628800};
int  main()
{

int T,n,D,m,i,j,k,base;
read(T);
while(T--)
{
memset(f,0,sizeof(f));
memset(cnt,0,sizeof(cnt));
do c=getchar();while(c<'0'||c>'9');
n=0;
while(c<='9'&&c>='0')cnt[s[++n]=c-'0']++,c=getchar();
read(D);
f[0][0]=1;
m=1<<n;m--;

for(i=0;i<=m;i++)
for(j=0;j<D;j++)
for(k=1,base=1;k<=n;base<<=1,k++)
if(!(i&base))
{
f[i|base][(10*j+s[k])%D]+=f[i][j];
}
int ans=f[m][0];
for(i=0;i<10;i++)ans/=F[cnt[i]];
printf("%d\n",ans);
}
return 0;
}