邮票面值设计java_蓝桥杯java 算法提高 邮票面值设计

import java.util.Scanner;

public class Main {

static int N, K;

static int count[] = new int[11];

static int sum[] = new int[11];

static int Value[] = new int[1000];

public static void main(String[] args) {

Scanner in = new Scanner(System.in);

N = in.nextInt();

K = in.nextInt();

in.close();

count[1] = 1;

Dp(1);

for (int i = 1; i <= K; i++) {

System.out.print(sum[i] + " ");

}

System.out.println();

System.out.print("MAX=" + (sum[0] - 1));

}

private static void Dp(int dp) {

int x = getbig(dp);

if (dp == K) {

return;

}

for (int i = x; i > count[dp]; i--) {

count[dp + 1] = i;

Dp(d