eden破解密文

 题目名称

破解密文

题目描述

题目大意：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 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.

输出：giving the original plaintext message, with no spaces and a new line in the end.

样例：

  输入：

3
ttyohhieneesiaabss

输出：

thisistheeasyoneab

 HINT

数组操作。

scanf("%d", &num);
char tempChar = getchar();
char str[201];
gets(str);
int len = strlen(str);

题目难度

      0

我的理解

      给一串信息进行加密处理，加密方式是将该串信息以矩阵一列一列输入，如果矩阵没有满则随机补充到最后形成一个完整的矩阵，然后以一列一列蛇形输出（即第一行从左到右第二行从右到左，第三行又从左到右依次类推），输出的数字串即为加密后的密码。

      举个例子：需要对xiaoyubei进行加密，则输入变成矩阵xob一列一列地输入，刚好填满，然后蛇形输出xobeyiaui那么这个得到的就是密码。

                                                                            iye

                                                                            aui

      题目给定输入是加密后的密码，需要你进行输出原本的信息；即输入了xobeyiaui让我们转换为xiaoyubei。

方法&解释

      这一题我就直接以二维数组a来储存输入并且输入以按照它加密的矩阵形式排列，关键在输入成为这样一个矩阵，那么输出即直接一列一列输出即可；

      我直接用i表示输入列数，循环从1->n，j表示行数，最开始为1，每一次i==n时，j++，说明一行结束，输入储存a数组时要判断j是奇数还是偶数，如果j为奇数则按照从左到右的顺序，如果j是偶数则按照从右往左的顺序，最后矩阵完成，要以'\n'结束判断，原本应该是'\0'题目所给的，我也不知道为什么，等下我再查一查，修改一下，要注意最开始输入n的时候有一个回车，这个字符要消除掉，否则会影响后面的输入。

我的代码

 

#include<stdio.h>
int main() {
    int n;
    scanf("%d", &n);
    char a[20][20] = {0};
    char t;
    scanf("%c", &t);
    int i = 1, j = 1, k = 0;
    while (t != '\0') {
        if (k == 1) break;
        for (i = 1; i <= n; i++) {
        scanf("%c", &t);
        if (t != '\n') {
            if (t < 'a') {
                t = t + 'a' -'A';
            }
            if (j % 2 == 0) {
                a[j][n - i + 1] = t;
            } else {
                a[j][i] = t;
            }
        } else {
            k = 1;
            break;
        }
        if (i == n) j++;
        }
    }
    int row = j - 1;
    for (j = 1; j <= n; j++) {
        for (i = 1; i <= row; i++) {
            printf("%c", a[i][j]);
        }
    }
    printf("\n");
}

标程代码

/*
 * this is the direct but stupid way. you can improve it by yourself by using one array.
 */
 
#include<stdio.h>
#include<string.h>
 
char tmp[101][21];
char temp[101][21];
 
int main() {
    int num, i, j;
    // for input.
    scanf("%d", &num);
    char tempChar = getchar();
    char str[201];
    gets(str);
    int len = strlen(str);
    int row = len/num;
    for (i = 0; i < len; i++) {
        tmp[i/num][i%num] = str[i];
    }
    // for processing.
    for (i = 0; i < row; i++) {
        for (j = 0; j < num; j++) {
            if (i%2 == 1) temp[i][j] = tmp[i][num - j - 1];
            else temp[i][j] = tmp[i][j];
        }
    }
    // for output.
    for (i = 0; i < num; i++) {
        for (j = 0; j < row; j++) {
            printf("%c", temp[j][i]);
        }
    }
    printf("\n");
    return 0;
}

标程解释