Submission #4018420

---

Source Code Expand

#include "iostream"
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <cstring>
#include <math.h>
#include <cctype>
#include <stack>
#include <vector>
#include <list>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
using namespace std;
using ll=long long;
#define MOD  1000000007

int n;
ll tri[1000100];

int main(int argc, char const *argv[]) {
  tri[0]=0; tri[1]=0; tri[2]=1;
  for(int i=3; i<1000100; i++){
    tri[i]=(tri[i-1]+tri[i-2]+tri[i-3])%10007;
  }
  std::cin >> n;
  std::cout << tri[n-1] << '\n';

  return 0;
}

Submission Info

Judge Result