import java.util.*; public class Solution { public int cutRope (int n) { int max = 0; for(int i = 1;i<n;i++){ max = Math.max(maxProduct(n,i),max); } return max; } private int maxProduct(int n,int m){ int average = n/m; int remainder = n%m; int product = 1; for(int i=0;i<m;i++){ if(i<remainder){ product *= (average+1); }else{ product *= average; } } return product; } }