首次學習字典所有排序用法
//====================================================================||
// Name : Lexicographic Order.cpp ||
// Date : 2013/5/27 下午8:57:00 ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
Int p\[50\];
char str\[100\],ans\[100\];
char str2\[100\];
char sid\[600\];
bool vis\[100\];
void pre(){
p\[0\]=1;
for(int i=1;i<50;i++){
p\[i\]=i\*p\[i-1\];
}
}
int main() {
ios\_base::sync\_with\_stdio(0);
int test;
scanf("%d%\*c",&test);
pre();
Int n;
int len;
int ff=0;
while(test--){
Set(vis,0);
scanf("%s %lld",str,&n);
strcpy(str2,str);
len=strlen(str);
sort(str,str+len);
for(int i=0;i<len;i++){
int cnt=1;
for(;n>p\[len-i-1\];cnt++){
n-=p\[len-i-1\];
}
for(int j=0;j<len;j++){
if(!vis\[j\]){
cnt--;
if(cnt==0){
ans\[i\]=str\[j\];
vis\[j\]=1;
break;
}
}
}
}
printf("Case %d: ",++ff);
for(int i=0;i<len;i++){
for(int j=0;j<len;j++){
if(ans\[j\]==str\[i\]){
putchar(str2\[j\]);
}
}
}
Pln();
}
}