bzoj1072: [SCOI2007]排列perm

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<set>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
#define ll long long
char ch[20];
set<ll>s;
int a[20];
int main(){
    int n;scanf("%d",&n);
    while(n--){
        s.clear();
        scanf("%s",ch+1);int d;scanf("%d",&d);
        ll tmp;int len=strlen(ch+1),ans=0;
        rep(i,1,len) a[i]=ch[i]-‘0‘;
        sort(a+1,a+len+1);
        while(1){
            tmp=0;
            rep(i,1,len) tmp=tmp*10+a[i];
            if(!s.count(tmp)&&tmp%d==0){
                ans++;s.insert(tmp);
            }
            if(!next_permutation(a+1,a+len+1)) break;
        }
        printf("%d\n",ans);
    }
    return 0;
}