Sciliy 1007. To and Fro

原创 2016年06月01日 23:43:30


Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number ofcolumns and write the message (letters only) down the columns, padding with extra random letters soas to make a rectangular array of letters. For example, if the message is "There's no place like home ona snowy night" and there are five columns, Mo would write downt o i o yh p k n ne l e a ir a h s ge c o n hs e m o tn l e w xNote that Mo includes only letters and writes them all in lower case. In this example, Mo used thecharacter `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 andright-to-left. So, the above would be encrypted astoioynnkpheleaigshareconhtomesnlewxYour job is to recover for Larry the original message (along with any extra padding letters) from theencrypted one.

Input

There will be multiple input sets. Input for each set will consist of two lines. The first line will containan integer in the range 2 . ..20 indicating the number of columns used. The next line is a string of upto 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end ofinput.

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
thisistheeasyoneab

题目大意:

讲不清楚。。。

给出一段字母,把它从左到右,从右到左排列成矩阵,每行n个字母。然后每列地输出


下面给个思路比较清晰的代码,最开先自己写,虽然ac了,但是思路超级混乱。

这个代码的思路是用一个二维矩阵根据输入顺序存储,但是二维数组的顺序是有序的。


#include<iostream>
#include<cstring>
using namespace std;
char cra[21][101];
char charactor[201];
int main()
{
	int n;
	while(cin>>n&&n>=2&&n<=20&&n!=0)
	{
		cin>>charactor;
		int len=strlen(charactor);
		int row=len/n;
		int x=0,y=0;
		for(int i=0;i<len;i++)
		{
			cra[x][y]=charactor[i];
			if(x%2==0)
			{
				y++;
				if(y==n)
				{
					x++;
					y--;
				}
			}
			else 
			{
				y--;
				if(y==-1)
				{
					x++;
					y++;
				}
			}
		}
		for(int j=0;j<n;j++)
		{
			for(int i=0;i<len/n;i++)
			{
				cout<<cra[i][j];
			}
		}
		cout<<endl;
	}
	return 0;
	
} 





版权声明:本文为博主原创文章,未经博主允许不得转载。

杭电OJ——1007 Quoit Design(最近点对问题)

Quoit Design Problem Description Have you ever played quoit in a playground? Quoit is a game in w...
  • lishuhuakai
  • lishuhuakai
  • 2013年06月24日 14:03
  • 7941

记录FFmpeg的help文档中命令行参数。

Synopsis: ffmpeg [global_options] {[input_file_options] -i input_file}... {[output_file_options]outp...
  • liuer2004_82
  • liuer2004_82
  • 2016年02月08日 17:18
  • 1993

iOS8 - - 一些适配

1:Attempting to badge the application icon but haven't received permission from the user to badge th...
  • u011662420
  • u011662420
  • 2014年10月21日 00:14
  • 1699

sicily 1007 To and Fro (基础题)

链接:http://soj.me/show_problem.php?pid=1007 Description Mo and Larry have devised a way of en...
  • u012823258
  • u012823258
  • 2014年04月28日 20:38
  • 955

sicily 1007. To and Fro

1007. To and Fro Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Mo and Larry...
  • yinjiakang
  • yinjiakang
  • 2015年10月11日 17:02
  • 204

1007[To and Fro]

Description Mo and Larry have devised a way of encrypting messages. They first decide secretly on...
  • u012392937
  • u012392937
  • 2013年10月10日 15:27
  • 529

1007. To and Fro

1007. To and Fro Description Mo and Larry have devised a way of encrypting messages. They firs...
  • luojiayu14
  • luojiayu14
  • 2011年12月14日 14:01
  • 1978

POJ 2039:To and Fro

To and Fro Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 8632   Acc...
  • u010885899
  • u010885899
  • 2015年08月11日 10:23
  • 278

hdu 1200 To and Fro

To and Fro Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tot...
  • qq_33913037
  • qq_33913037
  • 2017年06月05日 20:59
  • 92

HDOJ/HDU 1200 To and Fro(加密解密字符串)

Problem Description Mo and Larry have devised a way of encrypting messages. They first decide secre...
  • qq_26525215
  • qq_26525215
  • 2016年05月27日 16:23
  • 5949
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Sciliy 1007. To and Fro
举报原因:
原因补充:

(最多只允许输入30个字)