1.动态规划解题
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Main obj=new Main();
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
System.out.println(obj.clamb(n,m));
}
public int clamb(int n,int m){
int[] dp=new int[n+1];
Arrays.fill(dp,0);
dp[0]=1;
for(int j=1;j<=n;j++){//遍历背包
for(int i=1;i<=m;i++){
if(j>=i){
dp[j]+=dp[j-i];
}
}
}
return dp[n];
}
}