题解 | #放苹果#

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        int a = in.nextInt();
        int b = in.nextInt();
        System.out.println(count(a, b));
    }

    public static int count(int m, int n) {
        if(m==0 || n==1) {
            return 1;
        }
        // 这种算法题要耐心分析：互斥相加，计算机递归解法
        if(m < n) {
            return count(m, n-1);
        } else {
            return count(m, n-1) + count(m-n, n);
        }
    }
}