Submission #2209602

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <tuple>
#include <queue>
#include <set>
#include <math.h>
#include <array>
#include <list>
#include <set>
const int MOD=10007;
const int INF=1000000000;
using namespace std;
typedef long long ll;
typedef tuple<ll,int,int> p;
typedef vector<int> vi;
set <int> st;
int n;
vi a(1000005);
int main(int argc,char const* argv[])
{
  cin >> n;
  a[0]=0;a[1]=0;a[2]=1;
  for(int i=3;i<n;i++)
    {
      a[i]=(a[i-1]+a[i-2]+a[i-3])%MOD;
    }
  cout << a[n-1] << endl;
  return 0;
      
}

Submission Info

Judge Result