题解 | #尼科彻斯定理#

const readline = require("readline");

const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout,
});

rl.on("line", function (line) {
    const num = parseInt(line);
    const arr: number[] = [];
    if (num % 2 === 0) {
        const min = num * num - num + 1;
        const max = num * num + num - 1;
        for (let i = min; i <= max; i = i + 2) {
            arr.push(i);
        }
    } else {
        const min = num * num - Math.floor(num / 2) * 2;
        const max = num * num + Math.floor(num / 2) * 2;
        for (let i = min; i <= max; i = i + 2) {
            arr.push(i);
        }
    }
    console.log(arr.join("+"));
});