hdu 1200 To and Fro(简单模拟或DP)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1200

To and Fro

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5129    Accepted Submission(s): 3550

Problem 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

5

toioynnkpheleaigshareconhtomesnlewx

3

ttyohhieneesiaabss

0

 

 

Sample Output

theresnoplacelikehomeonasnowynightx thisistheeasyoneab

 

题目大意:输入按照题目中列举的矩阵输入，假使从第0行开始，也就是偶数行按序输入，奇数行反序输入。最后输出的时候是按列输出~

 

有两种方法：第一种是DP，用dp这个数组来按照原有矩阵进行存放。最后直接输出dp即可。第二种就是直接模拟，比如第一列的就是，0,9,10,19,20,29,30；将其分成两组，第一组由0,10,20,30组成，第二组由9,19,29组成；进一步解释就是第一组的（位置数-i）%n==0；第二组的（位置数+i+1）%n==0；

 

 

详见代码。

 

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

char ch[210];
char dp[110][20];

int main ()
{
    int n;
    while (~scanf("%d",&n),n)
    {
        scanf("%s",ch);
        int x=0,y=0;
        int len=strlen(ch);
        for (int i=0; i<len; i++)
        {
            dp[x][y]=ch[i];
            if (x%2==0)
            {
                y++;
                if (y==n)
                {
                    x++;
                    y--;
                }
            }
            else
            {
                y--;
                if (y==-1)
                {
                    x++;
                    y++;
                }
            }

        }
        for (int i=0; i<n; i++)
        {
            for (int j=0; j<x; j++)
            {
                printf ("%c",dp[j][i]);
            }
        }
        printf ("\n");
    }
    return 0;
}

第二种模拟代码，详见注释

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int main()
{
    int n;
    char ch[250];
    while(scanf("%d",&n),n)
    {
        scanf("%s",ch);
        int l=strlen(ch);
        for(int i=0;i<n;i++)            //i表示第几列
        {
            for(int j=0;j<l;j++)        //j表示第几个数
            {
                if((j/n)%2==0)          //判断奇偶行
                {
                    if((j-i)%n==0)      //满足第一组的条件
                        printf("%c",ch[j]);
                }
                else
                {
                    if((j+i+1)%n==0)     //满足第二组的条件
                        printf("%c",ch[j]);
                }
            }
        }
        printf("\n");
    }
    return 0;
}