Repeating Cipher CodeForces - 1095A

Polycarp loves ciphers. He has invented his own cipher called repeating.

Repeating cipher is used for strings. To encrypt the string s=s1s2…sm (1≤m≤10), Polycarp uses the following algorithm:

he writes down s1 ones,
he writes down s2 twice,
he writes down s3 three times,
…
he writes down sm m times.
For example, if s=“bab” the process is: “b” → “baa” → “baabbb”. So the encrypted s=“bab” is “baabbb”.

Given string t — the result of encryption of some string s. Your task is to decrypt it, i. e. find the string s.

Input
The first line contains integer n (1≤n≤55) — the length of the encrypted string. The second line of the input contains t — the result of encryption of some string s. It contains only lowercase Latin letters. The length of t is exactly n.

It is guaranteed that the answer to the test exists.

Output
Print such string s that after encryption it equals t.

Examples
Input
6
baabbb
Output
bab
Input
10
ooopppssss
Output
oops
Input
1
z
Output
z

找规律，0，1，3，6，10……输出就可以了

#include<string.h>
#include<string>
#include<iostream>
using namespace std;
int main()
{
int n;
char s[100];
cin>>n;
scanf("%s",s);
int k=0;
for(int i=1;s[k]!='';i++)
{
printf("%c",s[k]);
k=k+i;
}
//cout<<endl;
return 0;
}

最后

以上就是无私红牛为你收集整理的Repeating Cipher CodeForces - 1095A的全部内容，希望文章能够帮你解决Repeating Cipher CodeForces - 1095A所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。