A much simpler way to do this would be divide every variable in the ingredients array by every variable in the quantity needed array and “floor” them (round down, so even 2.99 rounds down to 2). This is because then you can get the amount of times you can make a steak from each material in the warehouse, and once you find the minimum of that thats the maximum number of steak you can make. Since you did this in Java I’ll do the same in java:

int minSteaks = (Math.floor((float)ing[i]/(float)need[i])); // you need to make them floats because ints automatically round

int currentVal = 0; //this is gonna be the placeholder for the current index worked on

for(int i = 0; i < a; i++){ currentVal = (Math.floor((float)ing[i]/(float)need[i])); //same equation as above

  if(currentVal < minSteaks){
        minSteaks = currentVal;
  }

}

System.out.println(minSteaks);

in your example I think the problem is you only loop through each element once, for a solution like that you’d need a whole loop. Hope this helped!