nnd.....‘\0’不是空格。。。一个ASCLL码是0,一个是32。。。。。T T!!
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long i64;
#define out64 "%lld\n"
#define in64 "%lld"
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b) for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a) for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b) for( int i = (a) ; i >= (b) ; i --)
#define S64(a) scanf(in64,&a)
#define SS(a) scanf("%d",&a)
#define LL(a) ((a)<<1)
#define RR(a) (((a)<<1)+1)
#define pb push_back
#define CL(Q) while(!Q.empty())Q.pop()
#define MM(name,what) memset(name,what,sizeof(name))
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 222;
const int maxc = 33;
int n,m;
int a[maxn];
char c[maxn];
char ans[maxn];
int ex[maxc][maxn];
i64 xx[maxc];
int x[maxn];
int y[maxn];
int main()
{
xx[0]=1;
for(int i=1;i<maxc;i++)
{
xx[i]=xx[i-1]*2;
}
while(cin>>n)
{
if(n==0) return 0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
ex[0][a[i]]=i;
}
for(int i=1;i<maxc;i++)
{
for(int u=1;u<=n;u++)
{
ex[i][u]=ex[i-1][ex[i-1][u]];
}
}
while(cin>>m)
{
if(!m) break;
for(int i=1;i<=211;i++)
{
x[i]=i;
}
MM(c,0);
cin.getline(c,211);
for(int i=0;xx[i]<=m;i++)
{
if(m&xx[i])
{
for(int u=1;u<=n;u++)
{
y[u]=x[ex[i][u]];
}
for(int u=1;u<=n;u++)
{
x[u]=y[u];
}
}
}
for(int i=1;i<=n;i++)
{
if(c[i]=='\0')
{
c[i]=' ';
}
}
for(int i=1;i<=n;i++)
{
ans[i]=c[x[i]];
}
for(int i=1;i<=n;i++)
{
cout<<ans[i];
}
cout<<endl;
}
cout<<endl;
}
return 0;
}