题解 | #尼科彻斯定理#

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int m = in.nextInt();
        int mm = m*m*m;
        int[] a = new int[mm/2];
        int len = 0;
        outer:
        for(int i = 0; i<=mm/2; i++){
            int k = 0;
            int sum = 0;
            for(int j = 2*i+1; j<=mm; j+=2){
                a[k] = j;
                k++;
                sum += j;
                len = k;
                if(sum==mm && k==m){
                    break outer;
                }else if(sum>mm){
                    break;
                }
            }
        }
        for(int o = 0; o<len-1; o++){
            System.out.print(a[o]+"+");
        }
        System.out.print(a[len-1]);
    }
}