//This code was designed to solve a problem given by World Champion . //Problem : Write a program to display the number as the sum of cubes with minimum number of operations. //Bonus : It will display if the number is Ramanujan Hardy Number or not. import java.util.*; import java.util.stream.Collectors; public class Sum_as_cubes { public static int minsum; public static List> cubes = new ArrayList>(); public static void main(String[] args) { try{ int num= new Scanner(System.in).nextInt() , k=0 ; minsumcubes(num) ; System.out.println("Number entered : "+num+"\nThe mininum number of operations are " + minsum+"\n"); for(int i=0;i=2) System.out.println("This is a Ramanujan Hardy Number"); } catch (Exception e){ System.out.println("Please enter a number"); } } public static void minsumcubes(int num){ int limit = (int)Math.cbrt(num) , n=0 , min =num , temp = num ,templimit = limit , i = limit , a=0 ; List cube= new ArrayList<>(); List> arr = new ArrayList<>(); while ( i > 0){ temp-=Math.pow(templimit,3); cube.add(n++,templimit); if (temp==0) { //System.out.println(cube.toString()); if(min>=n) { min=n; Collections.sort(cube); arr.add(a++,cube); } cube = new ArrayList<>(); i--; temp=num; templimit=i; n=0; continue ; } templimit=(int)Math.cbrt(temp); } //System.out.println(arr.toString()); arr=arr.stream().distinct().collect(Collectors.toList()); //System.out.println(arr.toString()); cubes=arr; minsum = min; } }

Sum as cubes