题解 | #尼科彻斯定理#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        // while (in.hasNextInt()) { // 注意 while 处理多个 case
        //     int a = in.nextInt();
        //     int b = in.nextInt();
        //     System.out.println(a + b);
        // }
        int m = in.nextInt();
        int[] arr = new int[m];
        int sum = m * m * m;
        int start = 0;
        for (int i = 1; i < sum; i += 2) {
            int temp = m * i;
            for (int j = 0; j < m; j++) {
                temp += 2 * j;
            }
            if (temp == sum) {
                start = i;
                break;
            }
        }
        int count = 0;
        while (count < m) {
            if (count == m - 1) {
                System.out.print((start + 2 * count));
                count++;
            } else {
                System.out.print((start + 2 * count) + "+");
                count++;
            }
        }
    }
}