fork download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MOD = 1e9 + 7;
  5. const int MAXN = 1e5 + 5;
  6.  
  7. int dp[MAXN];
  8.  
  9. int main() {
  10. int n, k;
  11. cin >> n >> k;
  12.  
  13. dp[1] = 1;
  14.  
  15. for (int i = 2; i <= n; i++) {
  16. for (int j = 1; j <= k && i - j >= 1; j++) {
  17. dp[i] = (dp[i] + dp[i - j]) % MOD;
  18. }
  19. }
  20.  
  21. cout << dp[n] << endl;
  22. return 0;
  23. }
  24.  
Success #stdin #stdout 0.01s 5284KB
stdin
100 4
stdout
793360461