[sicily online]1007. To and Fro

來源:互聯網
上載者:User
/*ConstraintsTime Limit: 1 secs, Memory Limit: 32 MBDescriptionMo 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.InputThere 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.OutputEach input set should generate one line of output, giving the original plaintext message, with no spaces.Sample Input5toioynnkpheleaigshareconhtomesnlewx3ttyohhieneesiaabss0Sample Outputtheresnoplacelikehomeonasnowynightxthisistheeasyoneab*/#include<iostream>#include<fstream>#include<vector>#include<string>#include<algorithm>#include<cmath>#include<string.h>using namespace std;char message[20][200];int main(){string msg;int col;while(cin>>col&&col!=0){cin>>msg;int line=(msg.size()+1)/col;for(string ::size_type i=0;i<msg.size();i++){int hang=i/col;int lie;hang%2==0?lie=i%col:lie=col-1-i%col;message[hang][lie]=msg[i];}//end forfor(int j=0;j<col;j++){for(int i=0;i<line;i++)cout<<message[i][j];}//end forcout<<endl;}//end while}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.