题解 | #尼科彻斯定理#
尼科彻斯定理
https://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNextInt()) { int m = sc.nextInt(); int sum = m * m * m; for(int i = 1;i<sum;i+=2){// 循环的数都为奇数 StringBuilder sb = new StringBuilder(); int tmp = 0; for(int j = 0;j<2*m;j+=2){// 循环m次,每次+2 tmp += (i+j); sb.append( i + j + "+"); } if(tmp == sum){ // 去掉最后一个+号 System.out.println(sb.deleteCharAt(sb.length()-1)); } } } } }