package javaa.Testt1.Testt2;

import java.util.Scanner;

class t {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int k = scanner.nextInt();
        countPartitionsWithMin(0, k, n, 1);
        System.out.println(countP);
    }

    static int countP = 0;

    public static void countPartitionsWithMin(int cur, int k, int n, int start) {
        if (k <= 0 || n <= 0) {
            if (k == 0 && n == 0) {
                countP++;
            }
            return;
        }
        for (int i = start; i <= n; i++) {
            //            // 剪枝
            if (k == 1 && n - i != 0) {
                continue;
            }
            countPartitionsWithMin(cur + i, k - 1, n - i, i);
        }
    }
}
``````java