题解 | #尼科彻斯定理#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static int[] nikoTheorem(int m) {
        int[] niko = new int[m];
        // 首项规律为m*(m-1)+1
        int first = m * (m - 1) + 1;
        // 将问题转化为公差为2的等差数列求和
        for (int i = 0; i < m; i++) {
            niko[i] = first + 2 * i;
        }
        return niko;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int m = in.nextInt();
        int[] result = nikoTheorem(m);
        for (int i = 0; i < result.length; i++) {
            if (i != result.length - 1) {
                System.out.print(result[i] + "+");
            } else {
                System.out.print(result[i]);
            }
        }
    }
}