sicily 1001. To and Fro
2014-02-28 22:19
239 查看
Description
Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding
with extra random letters so as to make a rectangular array of letters. For example, if the message is "There's no place like home on a snowy night" and there are five columns, Mo would write down t o i o y h p k n n e l e a i r a h s g e c o n h s e m o t
n l e w x Note that Mo includes only letters and writes them all in lower case. In this example, Mo used the character `x' to pad the message out to make a rectangle, although he could have used any letter. Mo then sends the message to Larry by writing the
letters in each row, alternating left-to-right and right-to-left. So, the above would be encrypted as toioynnkpheleaigshareconhtomesnlewx Your job is to recover for Larry the original message (along with any extra padding letters) from the encrypted one.
Input
There will be multiple input sets. Input for each set will consist of two lines. The first line will contain an integer in the range 2 . ..20 indicating the number of columns
used. The next line is a string of up to 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end of input.
Output
Each input set should generate one line of output, giving the original plaintext message, with no spaces.
Sample Input
Copy sample input to clipboard
Sample Output
#include <stdio.h>
#include <string.h>
char str[201];
int len;
int i;
int cnt;
int j;
int temp;
int step;
int columns;
int main()
{
while(scanf("%d", &columns)&&columns)
{
gets(a);
len=strlen(a);
count=0;
j=0;
int i;
for(i=0;count<len;i++)
{
temp=j+2*n*i;
if(temp<len)
{
cout<<a[temp];
count++;
}
else
{
j++;
i=-1;
continue;
}
temp=2*n*(i+1)-1-j;
if(temp<len&&count<len)
{
cout<<a[temp];
count++;
}
else
{
j++;
i=-1;
}
}
cout<<endl;
}
return 0;
}
Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding
with extra random letters so as to make a rectangular array of letters. For example, if the message is "There's no place like home on a snowy night" and there are five columns, Mo would write down t o i o y h p k n n e l e a i r a h s g e c o n h s e m o t
n l e w x Note that Mo includes only letters and writes them all in lower case. In this example, Mo used the character `x' to pad the message out to make a rectangle, although he could have used any letter. Mo then sends the message to Larry by writing the
letters in each row, alternating left-to-right and right-to-left. So, the above would be encrypted as toioynnkpheleaigshareconhtomesnlewx Your job is to recover for Larry the original message (along with any extra padding letters) from the encrypted one.
Input
There will be multiple input sets. Input for each set will consist of two lines. The first line will contain an integer in the range 2 . ..20 indicating the number of columns
used. The next line is a string of up to 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end of input.
Output
Each input set should generate one line of output, giving the original plaintext message, with no spaces.
Sample Input
Copy sample input to clipboard
5 toioynnkpheleaigshareconhtomesnlewx 3 ttyohhieneesiaabss 0
Sample Output
theresnoplacelikehomeonasnowynightx thisistheeasyoneab
#include <stdio.h>
#include <string.h>
char str[201];
int len;
int i;
int cnt;
int j;
int temp;
int step;
int columns;
int main()
{
while(scanf("%d", &columns)&&columns)
{
gets(a);
len=strlen(a);
count=0;
j=0;
int i;
for(i=0;count<len;i++)
{
temp=j+2*n*i;
if(temp<len)
{
cout<<a[temp];
count++;
}
else
{
j++;
i=-1;
continue;
}
temp=2*n*(i+1)-1-j;
if(temp<len&&count<len)
{
cout<<a[temp];
count++;
}
else
{
j++;
i=-1;
}
}
cout<<endl;
}
return 0;
}
相关文章推荐
- Sicily 1405. Mahershalalhashbaz, Nebuchadnezzar, and Billy Bob Benjamin Go to the Regionals
- Sicily 1938. Message Flood
- 二分法求解方程的近似解(sicily 1017)
- Sicily 11599. Tight words
- Sicily 7693. Cards
- Sicily 1002. Static Member
- Sicily 1011. Lenny's Lucky Lotto
- Sicily 14517. Eco-driving
- sicily 1071(搜索)
- [sicily]1007. To and Fro
- [sicily]1157. The hardest problem
- sicily 1009. Mersenne Composite N
- [sicily]1750. 运动会
- sicily 1211. 商人的宣传
- sicily1001 全排列(升序)
- sicily 1090. Highways
- [sicily]1935. 二叉树重建
- sicily 1875 Small tree
- sicily 1155. Can I Post the lette
- sicily 1218. 纪念邮票