zoukankan      html  css  js  c++  java
  • poj1026(置换找循环节)

    找到循环节,然后对应的变换

    Cipher
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 20377   Accepted: 5491

    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

    #include <iostream>
    #include <stdio.h>
    #include <math.h>
    #include <string.h>
    #include <algorithm>
    #include <stdlib.h>
    using namespace std;
    #define N 202
    
    int f[N];
    char g[N];
    char ans[N];
    int flag[N];
    int tmp[N];
    
    int main()
    {
        int n;
        while(scanf("%d",&n)&&n)
        {
            for(int i=1;i<=n;i++)
                scanf("%d",f+i);
            int t;
            while(scanf("%d",&t)&&t)
            {
                getchar();
                gets(g);
                int len=strlen(g);
                for(int i=len;i<n;i++)
                    g[i]=' ';
                memset(flag,0,sizeof(flag));
                for(int i=1;i<=n;i++)
                {
                    if(flag[i]==1 ) continue;
                    int cnt=1;
                    int s=i;
    
                    tmp[cnt]=s;
                    while(f[s]!=i)
                    {
                        cnt++;
                        s=f[s];
                        tmp[cnt]=s;
                        flag[s]=1;
                    }
                    int savecnt=cnt;
                    cnt=t%cnt;
                    s=i;
                    ans[tmp[ (cnt+1) ] -1]=g[ s-1 ];
                    int tcnt=1;
                    while(f[s]!=i)
                    {
                        tcnt++;
                        s=f[s];
                        int cntcnt=tcnt+cnt;
                        if(cntcnt>savecnt) cntcnt -= savecnt;
                        ans[tmp[ cntcnt ] - 1] = g[s-1];
                    }
                }
                for(int i=0;i<n;i++)
                    printf("%c",ans[i]);
                printf("
    ");
            }
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    NSInvocation的基本使用
    OC和JS代码的互调
    HTTPS的基本使用
    数据安全
    AFN框架
    部分文件的MIMEType
    linux中文件颜色,蓝色,白色等各自代表的含义
    CentOS下mysql常用命令
    mysql 完整备份和恢复
    mysqldump 导出提示Couldn't execute SELECT COLUMN_NAME...
  • 原文地址:https://www.cnblogs.com/chenhuan001/p/4846331.html
Copyright © 2011-2022 走看看