1007. To and Fro
2017-02-18 19:00
169 查看
Constraints
Time Limit: 1 secs, Memory Limit: 32 MBDescription
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, ifthe 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 thisexample, 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 beencrypted 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 setis 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
5 toioynnkpheleaigshareconhtomesnlewx 3 ttyohhieneesiaabss 0
Sample Output
theresnoplacelikehomeonasnowynightx thisis 4000 theeasyoneab
hint:水题
#include <iostream>#include <string>using namespace std;char map[20][200];int main(){int N;while (scanf("%d",&N) && N != 0){string tmp;cin >> tmp;int t = (int)tmp.length()/N;//printf("%d",t);int c=0,r=0,i=1,flag=1,pt=0;for (int n=0;n<tmp.length();n++){map[c][r]=tmp;if (pt==0){pt=1;c++;continue;}if (c==0||c==N-1){if (flag==1){flag=0;i=i*(-1);r++;}else flag=1,c+=i;}else c+=i;}for (int n=0;n<N;n++)for (int m=0;m<t;m++)printf("%c",map[m]);cout << endl;}return 0;}
相关文章推荐
- sicily 1007 To and Fro (基础题)
- 1007[To and Fro]
- sicily 1007 To and Fro (基地称号)
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- 1007 TO and Fro
- Sicily 1007 To and Fro
- 1007 sicily To and Fro
- To and Fro简单加密
- hdu 1200 To and Fro
- HDU 1200 || ZOJ 2208 To and Fro
- 【ACM】杭电1200:To and Fro
- poj 2039 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- zoj2208--------------------To and Fro