题解 | #尼科彻斯定理#

import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        scanner.useDelimiter("\n");

        int original = 0;
        while (scanner.hasNextInt()) {
            original = scanner.nextInt();
            if (original == 1) {
                System.out.println(1);
                continue;
            }
            int[] res = new int[original];
            int left;
            int i = 1;
		    //观察数据发现，如果原始值是偶数，那么中间的两个的值是原始值的平方-1和+1，如果是奇数，那么中间值是原始值的平方
            if (original % 2 == 0) {
			  //偶数找到最左边的值
                left = original * original - 1 - 2 * (original / 2 - 1);
            } else {
			  //奇数找到最左边的值
                left = original * original - 2 * (original / 2);
            }
            res[0] = left;
		  //遍历
            while (i <original) {
                res[i] = res[i - 1] + 2;
                i++;
            }
		  //输出
            for (int j = 0; j < res.length; j++) {
                if (j<res.length-1) {
                    System.out.print(res[j] + "+");
                } else {
                    System.out.print(res[j]);
                }
            }
        }
    }
}