codeforces 746 Decoding
来源:互联网 发布:java else什么意思 编辑:程序博客网 时间:2024/06/16 19:57
Polycarp is mad about coding, that is why he writes Sveta encoded messages. He calls the median letter in a word the letter which is in the middle of the word. If the word's length is even, the median letter is the left of the two middle letters. In the following examples, the median letter is highlighted: contest, info. If the word consists of single letter, then according to above definition this letter is the median letter.
Polycarp encodes each word in the following way: he writes down the median letter of the word, then deletes it and repeats the process until there are no letters left. For example, he encodes the word volga as logva.
You are given an encoding s of some word, your task is to decode it.
The first line contains a positive integer n (1 ≤ n ≤ 2000) — the length of the encoded word.
The second line contains the string s of length n consisting of lowercase English letters — the encoding.
Print the word that Polycarp encoded.
5logva
volga
2no
no
4abba
baba
In the first example Polycarp encoded the word volga. At first, he wrote down the letter l from the position 3, after that his word looked like voga. After that Polycarp wrote down the letter o from the position 2, his word became vga. Then Polycarp wrote down the letter g which was at the second position, the word becameva. Then he wrote down the letter v, then the letter a. Thus, the encoding looked like logva.
In the second example Polycarp encoded the word no. He wrote down the letter n, the word became o, and he wrote down the letter o. Thus, in this example, the word and its encoding are the same.
In the third example Polycarp encoded the word baba. At first, he wrote down the letter a, which was at the position 2, after that the word looked like bba. Then he wrote down the letter b, which was at the position 2, his word looked like ba. After that he wrote down the letter b, which was at the position 1, the word looked likea, and he wrote down that letter a. Thus, the encoding is abba.
找规律 例输入
4 abcd 输出 cabd
5 abcde 输出 dbace
6 abcdef 输出 ecabdf
偶数的字母先按倒序输出字母,奇数的字母再正序输出
using namespace std;
int n,i;
char s[2005];
int main()
{
cin >> n >> s;
for(i=n-2;i>=0;i-=2) cout << s[i];
for(i=(n+1)%2;i<n;i+=2) cout << s[i];
return 0;
}
- CodeForces 746B Decoding
- 746 B. Decoding codeforces
- 【codeforces 746B】 Decoding
- CodeForces 746B Decoding
- codeforces 746 Decoding
- 【Codeforces 746B Decoding】 + 构造
- codeforces 746 B. Decoding【水题】
- Decoding CodeForces
- Codeforces #386 B 746B Decoding
- Codeforces Round #386 (Div. 2) 746B Decoding
- CodeForces 222E Decoding Genome
- 【75.28%】【codeforces 764B】Decoding
- Mammoth's Genome Decoding CodeForces
- 746B Decoding
- 【codeforces 747B】Mammoth's Genome Decoding
- CodeForces 747B Mammoth's Genome Decoding
- Codeforces Round #386 (Div. 2) B. Decoding
- Codeforces Round #137 (Div. 2) 222E. Decoding Genome
- mac 终端常用命令和vim普通命令使用
- HDOJ 1418 抱歉
- 在别人电脑上运行本机tomcat项目的流程以及问题解决
- 习题6.5
- css:float的深度理解
- codeforces 746 Decoding
- socket阻塞与非阻塞,同步与异步、I/O模型
- 1-3 数组的反序输出
- 序列化和反序列化
- RGB转YUV色彩空间
- Azkaban3.x集群部署(multiple executor mode)
- 搭建 webrtc 信令服务器
- python基础笔记4
- 图之最小生成树-Prim算法和Kruskal算法