Skip to content

L1-039 古风排版

中国的古人写文字,是从右向左竖向排版的。本题就请你编写程序,把一段文字按古风排版。

输入格式:

输入在第一行给出一个正整数N(<100),是每一列的字符数。第二行给出一个长度不超过 1000 的非空字符串,以回车结束。

输出格式:

按古风格式排版给定的字符串,每列N个字符(除了最后一列可能不足N个)。

输入样例:

tex
4
This is a test case
4
This is a test case

输出样例:

tex
asa T
st ih
e tsi
 ce s
asa T
st ih
e tsi
 ce s

Solution:

java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(in.readLine());
        String s = in.readLine();
        int length = s.length();
        int size = (int) Math.ceil(length / (double) n);
        String[] sentence = new String[size];
        int index = 0;
        for (int i = 0; i < size; i++) {
            sentence[i] = s.substring(index, Math.min(index += n, length));
        }
        int t = sentence[sentence.length - 1].length();
        if (t < n) {
            StringBuilder sb = new StringBuilder(sentence[sentence.length - 1]);
            for (int i = 0; i < n - t; i++) {
                sb.append(" ");
            }
            sentence[sentence.length - 1] = sb.toString();
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            if (i > 0) sb.append("\n");
            for (int j = sentence.length - 1; j >= 0; j--) {
                sb.append(sentence[j].charAt(i));
            }
        }
        System.out.println(sb);
    }
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(in.readLine());
        String s = in.readLine();
        int length = s.length();
        int size = (int) Math.ceil(length / (double) n);
        String[] sentence = new String[size];
        int index = 0;
        for (int i = 0; i < size; i++) {
            sentence[i] = s.substring(index, Math.min(index += n, length));
        }
        int t = sentence[sentence.length - 1].length();
        if (t < n) {
            StringBuilder sb = new StringBuilder(sentence[sentence.length - 1]);
            for (int i = 0; i < n - t; i++) {
                sb.append(" ");
            }
            sentence[sentence.length - 1] = sb.toString();
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            if (i > 0) sb.append("\n");
            for (int j = sentence.length - 1; j >= 0; j--) {
                sb.append(sentence[j].charAt(i));
            }
        }
        System.out.println(sb);
    }
}

Released under the MIT License.