[Java] PAT甲级 1031 Hello World for U

虽然是一道20分的题，但是有一个条件还是挺有意思的。这个条件就是
n1 = n3 = max{ k | k ≤ n2 for all 3 ≤ n2 ≤ N}。其实上述条件就相当于n1 = n3 ≤ n2。
因为这个条件想了会所以记录下思考过程：题目中已知的条件是 n1 + n2 + n3 - 2 = N。若满足n1=n3则可得 :n2 = N + 2 - 2n3。
所以推出n3 ≤ N + 2 - 2n3。即n3 ≤ ( N + 2 ) / 3
代码如下：

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

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		char[] data = bf.readLine().toCharArray();
		int n3 = (data.length + 2) / 3;
		int n2 = data.length + 2 - 2 * n3;
		for (int i = 0; i < n3 - 1; i++) {
			System.out.print(data[i]);
			for (int j = 0; j < n2 - 2; j++)
				System.out.print(' ');
			System.out.println(data[data.length - i - 1]);
		}
		int count = 0;
		for (int i = n3 - 1; count < n2; i++) {
			System.out.print(data[i]);
			count++;
		}
	}
}