CodeForces
来源:互联网 发布:社会关系网络企业 编辑:程序博客网 时间:2024/06/10 03:08
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 gwhich was at the second position, the word became va. Then he wrote down the letter v, then the letter a. Thus, the encoding looked likelogva.
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 letterb, which was at the position 1, the word looked like a, and he wrote down that letter a. Thus, the encoding is abba.
规律题,题意是一串字符,每次输出中间位置的字符,如果是双数字符串中间取左边的一个,多写几个自然会发现规律。
#include<stdio.h>
#include<string.h>
int main()
{
int n,i,j,k;
char a[2005];
while(scanf("%d",&n)!=EOF)
{
getchar();
gets(a);
k=n;
if(n%2!=0)
{
for(i=n-2;i>=1;i=i-2)
{
printf("%c",a[i]);
}
for(i=0;i<n;i=i+2)
{
printf("%c",a[i]);
}
}
else
{
for(i=n-2;i>=0;i-=2)
{
printf("%c",a[i]);
}
for(i=1;i<n;i+=2)
{
printf("%c",a[i]);
}
}
printf("\n");
}
return 0;
}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- InnoDB定义的Mutex--02
- EL表达式
- 事务的模型
- MySQL--MDL,元数据锁的粒度
- MDL--元数据锁的锁请求与锁等待+元数据锁类对象
- CodeForces
- InnoDB---读未提交隔离级别的实现
- &&运算符,三木运算符与React的条件渲染
- pyqt5+matplotlib+Funcanimation+scatter(qt5+动态散点图)
- svn 2.5.9 提交代码 强制注释 svnlook.exe: invalid option character: ?
- 美标耳机和国标耳机硬件兼容设计-两线交换的硬件连接
- js代码判断浏览器种类IE、FF、Opera、Safari、chrome及版本
- clone实现
- 机器人操作系统ROS Indigo 入门学习(11)——创建一个ROS msg和srv