题解 | 买橘子
买橘子
https://www.nowcoder.com/practice/73e0552b78474a9086781e47f4e01d73
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
// 最小袋数初始化为一个极大值（表示初始未找到）
int minBags = Integer.MAX_VALUE;
// 最多可能的8个装袋数：n/8（向下取整）
int max8 = a / 8;
for (int num8 =max8;num8>=0; num8--) {
int num6=a-num8*8;
if (num6%6==0&&num6>=0){
int num = num6/6;
minBags = num+num8;
break;
}
}
System.out.println(minBags == Integer.MAX_VALUE ? -1 : minBags);
}
}
