Submission #16734906

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
const int N = 2e3 + 1;
int n;
long long int dp[N];
long long int calc(int value){
  if(value == n)return 1;
  if(value > n)return 0;
  long long int &ret = dp[value];
  if(ret != -1)return ret;
  ret = 0;
  for(int i = 3; i <= n; i++){
    ret += calc(value + i) % mod;
    ret %= mod;
  }
  return ret;
}
int main(){ 
  cin >> n;
  memset(dp, -1, sizeof dp);
  cout << calc(0);

  return 0;
}

Submission Info

Judge Result