题解 | #尼科彻斯定理#

#include <iostream>
using namespace std;

int main() {
    int n = 0;
    cin>>n;
    if(n%2 == 0){
        int MidlePower = n*n+1;
        int Midle = (n)/2;
        for(int k =0 ; k< n; k++)
        {   
            if(k != n-1)
            {
            cout << MidlePower + 2*(k-Midle) << "+";
            }
            else {
            cout << MidlePower + 2*(k-Midle);
            }
        } 
    }
    else {
        int MidlePower = n*n;
        int Midle = (n-1)/2;
        for(int k =0 ; k< n; k++)
        {   
            if(k != n-1)
            {
            cout << MidlePower + 2*(k-Midle) << "+";
            }
            else {
            cout << MidlePower + 2*(k-Midle);
            }
        }
    }
    
}
// 64 位输出请用 printf("%lld")