1元、2元、5元组合成100元，最多有多少种组合

public class MoneyTest {
    static long flag;
    public static void main(String[] args) {
        MoneyTest moneytest = new MoneyTest();

        for (int i = 0; i < 20; i++) { //5块钱
            for (int j = 0; j < (100 - 5 * i) / 2; j++) { //2块钱，100/2-5块钱
                for (int k = 0; k < 100 - 5 * i - 2 * j; k++) { //1块钱，100－5块钱-2块钱
                    flag++;
                }
            }
        }
        System.out.println("组合可能性" + flag);
    }
}