Submission #1511486

---

Source Code Expand

#include<iostream>
using namespace std;

int a[1000001];

int tori(int n){
  if(a[n] != -1){
    return a[n];
  }
  else{
    a[n] = (tori(n-1)+tori(n-2)+tori(n-3))%10007;
    return a[n];
  }
}

int main(){
  int n;
  cin >> n ;
  for(int i = 1; i < n+1; i++){
    a[i] = -1;
  }
  a[1] = 0;
  a[2] = 0;
  a[3] = 1;
  cout << tori(n) << endl;

  return 0;
}

Submission Info

Judge Result