题解 | #尼科彻斯定理#

尼科彻斯定理

https://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void (async function () {
    // Write your code here
    while ((line = await readline())) {
        let flag = line * line;
        let res = [];
        if (line % 2 != 0) {
            res.push(flag);
        }
        for (let i = 1; i <= line/2; i++) {
            if (line % 2 === 0) {
                res.push(flag-(2*i-1),flag+(2*i-1));
            }else{
                res.push(flag-2*i,flag+2*i)
            }
        }

        res.sort((a,b)=>a-b)
        console.log(res.join('+'))
    }
})();

全部评论

相关推荐

评论
1
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务