A. Repeating Cipher cf div3 529

A. Repeating Cipher
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Polycarp loves ciphers. He has invented his own cipher called repeating.Repeating cipher is used for strings. To encrypt the string ?=?1?2…??(1≤?≤10), Polycarp uses the following algorithm:
he writes down ?1 ones,
he writes down ?2 twice,
he writes down ?3
three times,

he writes down ?? ? times.
For example, if ?=“bab” the process is: “b” → “baa” → “baabbb”. So the encrypted ?=“bab” is “baabbb”.
Given string ?
— the result of encryption of some string ?. Your task is to decrypt it, i. e. find the string ?
.
Input
The first line contains integer ?
(1≤?≤55) — the length of the encrypted string. The second line of the input contains ? — the result of encryption of some string ?. It contains only lowercase Latin letters. The length of ? is exactly ?
It is guaranteed that the answer to the test exists.
Output

Print such string ?
that after encryption it equals ?

.
Examples
Input
Copy

6
baabbb

Output
Copy

bab

Input
Copy

10
ooopppssss

Output
Copy

oops

Input
Copy

1
z

Output
Copy

z
删除1 2 4…

#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin >> n)
{
string s;
cin >> s;
int k = 0;
for(int i = 0; i < n; i += ++k)
cout<<s[i];
cout<<endl;
}
return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值