解题思路:
注意事项:
参考代码:
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int m = scanner.nextInt(); int[] a = new int[n+1]; int[][] f = new int[n+1][m+1] ; for (int i = 1; i <= n; i++) { a[i] = scanner.nextInt(); } for (int i = 1; i <= a[1]; i++) { f[1][i] = 1; } for (int i = 1; i <= n; i++) { f[i][0] = 1; } for (int i = 2; i <= n; i++) { for (int j = 1; j <= m; j++) { for (int k = 0; k <= a[i]&&k<=j; k++) { f[i][j]=f[i][j]+f[i-1][j-k]; f[i][j] = f[i][j] % 1000007; } } } System.out.println(f[n][m]); } }
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题8.8 (C语言代码)浏览:687 |
C语言程序设计教程(第三版)课后习题10.2 (C语言代码)浏览:669 |
【出圈】 (C语言代码)浏览:553 |
C语言程序设计教程(第三版)课后习题6.7 (C语言代码)浏览:518 |
【出圈】 (C语言代码)浏览:794 |
WU-链表数据求和操作 (C++代码)浏览:1312 |
C语言程序设计教程(第三版)课后习题6.1 (C语言代码)浏览:697 |
【蟠桃记】 (C语言代码)浏览:1021 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:586 |
C语言程序设计教程(第三版)课后习题3.7 (C语言代码)浏览:561 |