poj1026Cipher
来源:互联网 发布:groovy 数组 编辑:程序博客网 时间:2024/06/13 22:57
Cipher
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21142 Accepted: 5806
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.
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
104 5 3 7 2 8 1 6 10 91 Hello Bob1995 CERC00
Sample Output
BolHeol bC RCE
Source
Central Europe 1995
#include<stdio.h>
#include<string.h>
int main()
{
int visit[210],pos[210],a[210];
char str[210],st[210];
int n,k,i,j,t;
while(scanf("%d",&n),n)
{
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
a[i]--;
}
while(scanf("%d",&k),k)
{
memset(visit,0,sizeof(visit));
memset(pos,0,sizeof(pos));
memset(st,'\0',sizeof(st));
getchar();
gets(str);
for(i=strlen(str);i<n;i++)
str[i]=' ';
for(i=0;i<n;i++)
{
t=0;
j=i;
if(!visit[j])
{
while(!visit[j])
{
visit[j]=1;
pos[t++]=j;
j=a[j];
}
}
for(j=0;j<t;j++)
st[pos[(k+j)%t]]=str[pos[j]];
}
printf("%s\n",st);
}
printf("\n");
}
return 0;
}
0 0
- poj1026Cipher
- poj1026Cipher
- Java Web学习(18):JavaBean四大作用域
- POJ 1062 昂贵的聘礼
- github下fork后如何同步源库的新更新内容?
- linux基础——linux进程间通信(IPC)机制总结
- CSU-ACM2016暑假集训比赛2
- poj1026Cipher
- HDU 1892 See you~
- 8086汇编语言 除数8位DIV指令实例
- Android集成微信支付让你不再踩坑
- 批量修改文件(或文件夹)权限或所有者
- c++设计模式之装饰模式
- 停止线程
- HDU 1445 Ride to School 贪心
- Python中常用的正则表达式处理函数