[POJ 1026]Cipher

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

题目大意：

给你一个置换，在给你很多字符串，对于每一个字符串，做m次置换，输出做完m次置换之后的字符串。

题解：

直接模拟肯定是会超时的，那么我们对于每一个位置，求出它所在的循环的长度len，那么实际上就只需要向后找m%len步就好了。

//Never forget why you start
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,a[205],sum[205],cnt,vis[205],b[205];
char s[205];
void dfs(int r){
  vis[r]=1;
  cnt++;
  if(vis[a[r]]){sum[r]=cnt;return;}
  else {dfs(a[r]);sum[r]=cnt;}
}
int main(){
  int i,j;
  while(scanf("%d",&n)!=EOF){
    if(n==0)break;
    memset(vis,0,sizeof(vis));
    for(i=1;i<=n;i++)scanf("%d",&b[i]),a[b[i]]=i;
    for(i=1;i<=n;i++)
      if(!vis[i]){
    cnt=0;
    dfs(i);
      }
    while(scanf("%d",&m)!=EOF){
      if(m==0)break;
      getchar();
      cin.getline(s,sizeof(s));
      int len=strlen(s);
      for(i=len;i<n;i++)s[i]=' ';
      for(i=0;i<n;i++){
    j=i+1;
    cnt=m%sum[j];
    while(cnt--)j=a[j];
    printf("%c",s[j-1]);
      }
      printf("
");
    }
    printf("
");
  }
  return 0;
}