package Two;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Find();
}
private static void Find() { //此方法将会找出你给定数字上限以下所有符合条件相续整数的立方
System.out.println("请输入一个数字作为上限,程序会自动找到符合相续正整数的立方:");
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] a= new int[n];
for(int i = 1;i <= n;i ++)
a[i-1] = i*i*i;
int sum = 0;
int count = 0;
for (int i = 0; i < a.length - 1; i++) {
for (int j = i; j < a.length; j++) {
sum += a[j];
if(Math.cbrt(sum) == (int)Math.cbrt(sum)) {//如果立方和开立方为整数,则符合条件
if(i<j) {
count ++;
System.out.print("("+count+")"+":");
for (int k = i+1; k < j+1; k++) {
System.out.print(k+"^3 + ");
}
System.out.print(j+1+"^3 = "+(int)Math.cbrt(sum)+"^3");
System.out.println();
}
}
}
sum = 0;
}
}
}