poj1026(置换找循环节)
2015-09-29 14:50
351 查看
找到循环节,然后对应的变换
Cipher
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 |
#include <iostream> #include <stdio.h> #include <math.h> #include <string.h> #include <algorithm> #include <stdlib.h> using namespace std; #define N 202 int f ; char g ; char ans ; int flag ; int tmp ; 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("\n"); } printf("\n"); } return 0; }
相关文章推荐
- 个人博客作业Week2
- Java内部类详解
- 解析浏览器的访问信息
- MATLAB中的diff函数
- POJ 1637 Sightseeing tour
- STUN和TURN技术浅析
- 【笔记】Spring MVC学习指南(十)国际化
- 用指向函数的指针比较大小
- 使用返回指针的函数查找最大数
- PHP curl post提交表单
- Android Studio导入github下载的工程
- C++ 11 - STL - 函数对象(Function Object) (下)
- Mecanim动画系统---切换问题(强制切换)
- 从Post请求中获取传递的Content
- android项目实战 --ListView 头部ViewPager广告轮询图效果
- 在Xcode中使用Git进行源码版本控制
- Android actionbar 使用简介
- 收集的技术书籍
- 通过iwpriv命令判断WIFI client和Ralink AP之间是否连接
- 机器学习简史