poj 1026解题报告

 

Cipher

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 13633		Accepted: 3438

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

打眼一看这就是一道考察置换的题，感觉没什么难度，然后想都没想就直接按模拟的方式写了，交上去发现TLE，因为初学没什么经验，而且第一次做这方面的题，想了半天也没有什么好的方法，于是，上网寻求大牛们的解题报告，这才知道，原来这道题还得可能给的数据很大，需要先将每一个置换位置的周期求出来，记为t[i]，然后进行变换时，每一个位置变换（k%t[i]）次，之后就Ok啦。。下面是我自己写的代码，跟大牛们的代码相比还是有很大差距的，呵呵，只能继续努力啦！

代码：

语言：c++

#include<iostream> #include<cstdio> #include<cstring> using namespace std; int main() { int k,n,t[210],change[210],tt; char a1[210],a2[210]; while(cin>>n) { if(n==0) break; for(int i=0;i<n;++i) cin>>change[i]; memset(t,0,sizeof(t)); for(int i=0;i<n;++i) { t[i]=1; tt=i+1; while(change[tt-1]!=i+1) { tt=change[tt-1]; ++t[i]; } } while(cin>>k) { if(k==0) break; getchar(); cin.getline(a1,n+1); int len=strlen(a1); for(int i=len;i<n;++i) a1[i]=' '; a1[n]='/0'; strcpy(a2,a1); for(int i=0;i<n;++i) { int temp=k%t[i]; tt=i+1; for(int j=1;j<=temp;++j) tt=change[tt-1]; a2[tt-1]=a1[i]; } cout<<a2<<endl; } cout<<endl; } return 0; }