Submission #6345678

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>

using namespace std;

typedef long long ll;

const ll MOD = 1e9 + 7;

ll K,N;

vector<ll> memo(100100100,-1);

ll dp( ll a){
  if( a < 0){ return 0;}
  if( memo[a] != -1){ return memo[a];}
  
  ll res = 0;
  for(ll i = 0; i < K; i++){
    res += dp(a-i); res %= MOD;}
  
  return memo[a] = res % MOD;}

int main(){
  cin >> K >> N;
  for(int i = 0; i < K; i++){
    memo[i] = 1;}
  cout << dp(N) << endl;
  return 0;}

Submission Info

Judge Result