pku1026 Cipher 클러스터 구성
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 13732
Accepted: 3470
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
： n a[i] k n
： i a[i] k
： TLE
T k=k%T k
T[i] k=k%T[i]
#include
<
stdio.h
>
#include
<
string
.h
>
int
main()
{
int
i,j,k;
int
n,len;
char
s1[
202
],s2[
202
],c;
int
a[
202
],b[
202
];
int
temp,t;
while
(scanf(
"
%d
"
,
&
n)
!=
EOF
&&
n)
{
for
(i
=
1
;i
<=
n;i
++
)
scanf(
"
%d
"
,
&
a[i]);
for
(i
=
1
;i
<=
n;i
++
)
{
t
=
i;
b[i]
=
1
;
while
(a[t]
!=
i)
{
t
=
a[t];
b[i]
++
;
}
}
scanf(
"
%d
"
,
&
k);
while
(k
!=
0
)
{
scanf(
"
%c
"
,
&
c);
gets(s1);
len
=
strlen(s1);
if
(len
<
n)
{
for
(i
=
len;i
<
n;i
++
)
{
s1[i]
=
'
'
;
}
s1[n]
=
'
/0
'
;
}
for
(i
=
0
;i
<
n;i
++
)
{
temp
=
k
%
b[i
+
1
];
t
=
i
+
1
;
while
(temp
--
)
t
=
a[t];
s2[t
-
1
]
=
s1[i];
}
s2[n]
=
'
/0
'
;
puts(s2);
scanf(
"
%d
"
,
&
k);
}
printf(
"
/n
"
);
}
return
0
;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
less 명령으로 파일을 다시 씁니다.less 명령이란? 텍스트 파일을 한 화면에 표시하는 명령less /var/log/messages 에서 messages 로그 파일을 확인할 수 있습니다. 대체로 확인할 때 less 를 사용하는 것이 많을까 생각합니다...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.
좋은 웹페이지 즐겨찾기
