1048.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 48 行

/*  This Code is Submitted by wywcgs for Problem 1048 on 2005-12-26 at 20:18:18 */ 
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

const int MAX = 256;

int main()
{
	int n, m, i, j;
	vector<int> loop[MAX];
	int inloop[MAX], pos[MAX];
	char word[MAX], code[MAX];
	
	while(scanf("%d", &n) != EOF && n != 0) {
		memset(inloop, -1, sizeof(inloop));
		for(i = 1; i <= n; i++) scanf("%d", &pos[i]);
		int vn = 0;
		for(i = 1; i <= n; i++) {
			if(inloop[i] == -1) {
				loop[vn].clear();
				for(j = i; inloop[j] == -1; j = pos[j]) {
					loop[vn].push_back(j);
					inloop[j] = vn;
				}
				vn++;
			}
		}
		while(scanf("%d", &m) != EOF && m != 0) {
			getchar();
			gets(word);
			int l = strlen(word);
			for(i = l; i < n; i++) word[i] = ' ';
			code[n] = word[n] = 0;
			for(i = 1; i <= n; i++) {
				int o = inloop[i], s = loop[o].size(), p;
				for(p = 0; loop[o][p] != i; p++) ;
				code[loop[o][(p+m)%s]-1] = word[i-1];
			}
			printf("%s\n", code);
		}
		putchar('\n');
	}
	
	return 0;
}