OpenJudge/1026.cpp at master · tongtzeho/OpenJudge · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include<iostream>
#include<cstring>
#include<string>
using namespace std;
int main()
{
	int i,j,k,t,q,c[201],turn[201],chain[201][201],chainsum,n,a[201],temp[201][201],x[201],y[201];
	char ch;
	while(cin>>n&&n!=0)
	{
		chainsum=0;
		for(i=1;i<=n;i++)
		{
			cin>>turn[i];
			a[i]=0;
		}
		for(i=1;i<=n;i++)
		{
			if(a[i]==0)
			{
				a[i]=1;
				j=turn[i];
				chainsum++;
				chain[chainsum][0]=1;
				chain[chainsum][1]=i;
				while(a[j]==0)
				{
					a[j]=1;
					chain[chainsum][0]++;
					chain[chainsum][chain[chainsum][0]]=j;
					j=turn[j];
				}
			}
		}
		while(cin>>k)
		{
			if(k==0)break;
			cin.get();
			i=0;
			while(cin.get(ch)&&ch!='\n')
			{
				i++;
				c[i]=int(ch);
			}
			for(i+=1;i<=n;i++)
				c[i]=32;
			for(i=1;i<=chainsum;i++)
			    for(j=1;j<=chain[i][0];j++)
				    temp[i][j]=chain[i][j];
			for(i=1;i<=chainsum;i++)
				for(j=1;j<=chain[i][0];j++)
				    for(q=1;q<=k%chain[i][0];q++)
					    temp[i][j]=turn[temp[i][j]];

			for(i=1;i<=chainsum;i++)
				for(j=1;j<=chain[i][0];j++)
				{
					x[temp[i][j]]=i;
					y[temp[i][j]]=j;
				}
			for(i=1;i<=n;i++)
				a[i]=chain[x[i]][y[i]];
			t=n+1;
			while(c[a[t-1]]==32)
				t--;
			for(i=1;i<t;i++)
				cout<<char(c[a[i]]);
			cout<<endl;
		}
		cout<<endl;
	}
	return 0;
}