题解 | #尼科彻斯定理#

#include <iostream>
#include <string>
using namespace std;

int main(){
    int m;
    int sum = 0;
    int first_num = 0;
    while(cin >> m){    
        for(int i = 0; i < (m*m*m); i++)
        {
            int temp = i;
            sum = 0;
            for(int j = 0; j < m; j++){
                if(i%2 != 0){
                    sum += temp;   
                    temp+=2;
                }               
            }
            if(sum == m*m*m)
            {
                first_num = i; //第一个奇数，赋值给它
                break;
            }        
        }
    }
    first_num = first_num - 2; //避免输出时，先将第一个奇数减去2
    for(int k = 0; k < m-1; k++){
        first_num += 2;
        cout<< first_num << "+";
    }
    cout <<first_num + 2<<endl;
    return 0;
}