Cipher(P1026)

好几天没有做题了，现在做一个，，感觉就好吃力的样子。

这个题首先直接模拟是会严重超时的。

先算所有的字符循环多少次后可以加原来的位置。由于，计算得到的结果中字符所对应的位是唯一确定的。所以就计算一下求出的模的次数就行（注意：用最小公倍数会超时，可能是整数存不了这么大的数了）

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int n;
	char go[1000];
	char cur[1000]; 
	int num[201];
	int pre[1000];

int get(int to,int i)
{
	if (i==to)
		return 1;
	return 1+get(to,pre[i]);
}

int gcd(int big,int small)
{
	if (big<small)
		swap(big,small);
	if (big%small==0)
		return small;
	return (small,big%small);
}

int main()
{
	freopen("in.txt","r",stdin);
	int i,j,k;
	int t;
	
	while (scanf("%d",&n)!=EOF)
	{
		if (n==0)
			break;
		for (i=1;i<=n;i++)
			scanf("%d",pre+i);

		for (i=1;i<=n;i++)
		{
			num[i]=get(i,pre[i]);
		}

	



		while (scanf("%d",&k)!=EOF)
		{
			if (k==0)
				break;
		
		gets(go);
		
		j=strlen(go);
		for (i=j;i<=n;i++)
			go[i]=' ';

		go[n+1]='\0';
		//cout<<go<<endl;
		
		/*
		k%=num[n];

		while (k--)
		{
			for (i=1;i<=n;i++)
				cur[pre[i]]=go[i];
			for (i=1;i<=n;i++)
				go[i]=cur[i];
		}
		*/
	
		for (i=1;i<=n;i++)
		{
			j=k%num[i];
			t=i;
			while (j--)
			{
				t=pre[t];
			}
			cur[t]=go[i];
		}

		for (i=1;i<=n;i++)
			printf("%c",cur[i]);
		printf("\n");
		}
		printf("\n");
	}

	return 0;
}

Cipher

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 16388		Accepted: 4273

Description

Bob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the secret key at their last meeting in Philadelphia on February 16th, 1996. They chose as a secret key a sequence of n distinct integers, a1 ; . . .; an, greater than zero and less or equal to n. The encoding is based on the following principle. The message is written down below the key, so that characters in the message and numbers in the key are correspondingly aligned. Character in the message at the position i is written in the encoded message at the position ai, where ai is the corresponding number in the key. And then the encoded message is encoded in the same way. This process is repeated k times. After kth encoding they exchange their message.

The length of the message is always less or equal than n. If the message is shorter than n, then spaces are added to the end of the message to get the message with the length n.

Help Alice and Bob and write program which reads the key and then a sequence of pairs consisting of k and message to be encoded k times and produces a list of encoded messages.

Input

The input file consists of several blocks. Each block has a number 0 < n <= 200 in the first line. The next line contains a sequence of n numbers pairwise distinct and each greater than zero and less or equal than n. Next lines contain integer number k and one message of ascii characters separated by one space. The lines are ended with eol, this eol does not belong to the message. The block ends with the separate line with the number 0. After the last block there is in separate line the number 0.

Output

Output is divided into blocks corresponding to the input blocks. Each block contains the encoded input messages in the same order as in input file. Each encoded message in the output file has the lenght n. After each block there is one empty line.

Sample Input

10
4 5 3 7 2 8 1 6 10 9
1 Hello Bob
1995 CERC
0
0

Sample Output

BolHeol  b
C RCE

Source

Central Europe 1995