Submission #155091

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>

using namespace std;

const int INF = 1 << 29;
typedef pair<int, int> P;

int n;
int tribo[1000000];
long long dp[1000000];

int main(void)
{
	memset(dp, 0, sizeof(dp));
	for (int i = 0; i < 1000000; i++)
	{
		if (i == 0) dp[i] = 0;
		else if (i == 1) dp[i] = 0;
		else if (i == 2) dp[i] = 1;
		else
		{
			dp[i] = (dp[i - 1] + dp[i - 2] + dp[i - 3]) % 10007;
		}
	}
	while (cin >> n && n)
	{
		cout << dp[n - 1] % 10007 << endl;
	}
	return 0;
}

Submission Info

Judge Result