Go: package main

import (
	"bufio"
		"os"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	dp := make([]int , 30)
	dp[0] = 1 // 1段の階段の登り方
	dp[1] = 2 // 2段の階段の登り方
	dp[2] = 4 // 3段の階段の登り方
	for i := 3; i < 30; i++ {
		// n段の階段の登り方は
		// n-1段の階段の登り方+n-2段の階段の登り方+n-3段の階段の登り方
		dp[i] = dp[i-1]+dp[i-2]+dp[i-3] 
	}
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		fmt.Println(((dp[n-1]+9)/10+364)/365)
	}
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)

template<typename T>
void remove(vector<T>& vector, unsigned int index){
vector.erase(vector.begin() + index);
}

typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
long long dp[31] = {1,1,2};
void func(int n){
	for(int i = 3; i <= 30; i++){
		dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
	}
}


int main(void){
	func(30);
	int n;
	while(cin >> n, n){
		cout << dp[n]/10/365+1 << endl;
	}

	return 0;
}



int StrToInt(string s){
	stringstream ss;
	ss << s;
	int val;
	ss >> val;
	return val;
}
string IntToStr(int i){
	stringstream ss;
	ss << i;
	return ss.str();
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>

using namespace std;

typedef long long ll;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)

ll d[40];
void solve(){

}
void show(){
  for(int i=0;i<40;i++){
    cout<<i<<":"<<d[i]<<endl;
  }
}
void init(){
  fill(d,d+40,0);
  d[1]=1;
  d[2]=2;
  d[3]=4;
  for(int i=4;i<31;i++){
    d[i]=d[i-3]+d[i-2]+d[i-1];
  }
}
int main(){
  int n;
  init();
  show();
  while(cin >> n,n){
    cout<<(d[n]/3650)+1<<endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    while(true){
        int y=0,n;
        int a[31]={0};
        cin>>n;
        if(n==0) break;
        a[1]=1;
        a[2]=2;
        a[3]=4;
        for(int i=4; i<31; i++){
            a[i]=a[i-1]+a[i-2]+a[i-3];
        }
        y=(a[n]/10)/365+1;
        cout<<y<<endl;
    }
}

C++: #include <iostream>
using namespace std;
int trib(int a){
	if(a==1){return 1;}
	if(a==2){return 2;}
	if(a==0){return 1;}
//	if(a==3){return }
	return trib(a-3)+trib(a-2)+trib(a-1);
}
int main() {
	// your code goes here
int a;
while(true){
	cin>>a;
	if(a==0){return 0;}
cout<<((trib(a)+1)/10+1)/365+1<<endl;
	
}
	return 0;
}

C++: #include <iostream>
#include <cstring>

using namespace std;

int memo[31];

int solve(int remain){
    int cnt = 0;

    if(memo[remain] != -1) return memo[remain];

    if(remain <= 0) return 0;
    if(remain == 1) return 1;
    if(remain == 2) return 2;
    if(remain == 3) return 4;

    for(int i=1;i<=3;++i){
        cnt += solve(remain - i);
    }

    return memo[remain] = cnt;
}


int main(void){
    int n;
    int val;

    while(cin >> n, n > 0){
        memset(memo,-1,sizeof(int)*31);

        val = solve(n)/10;
        val = val < 366 ? 1 : val % 365 == 0 ? val / 365 : val/365 + 1;
        cout << val << endl;
    }
}

C++: #include <iostream>
using namespace std;

int dp[31];

int main() {
	while(1){
		int n;
		cin >> n;
		if(n == 0)break;
	
		dp[1] = 1;
		dp[2] = 2;
		dp[3] = 4;
		for(int i = 4; i <= n; i++)
			dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
		
		int ans = (dp[n] % 3650 == 0) ? dp[n] /3650 : dp[n] / 3650 + 1;
	
		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int dp[31], n, i, result[100];

int main()
{	
	dp[0] = 1;
	dp[1] = 1;
	dp[2] = 2;

	for (int a = 3; a < 31; a++)
	{
		dp[a] = dp[a - 1] + dp[a - 2] + dp[a - 3];
	}

	for (;; i++)
	{
		cin >> n;
		if (n == 0)
		{
			break;
		}
		result[i] = dp[n] / 3650 + 1;
	}

	for (int a = 0; a < i; a++)
	{
		cout << result[a] << endl;
	}


	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
	int n;
	while( cin>>n ,n){  // nが0ならwhileを抜けます。

		int dp[50]={};  // 階段のかわり　（　余裕を持って50段用意しています　）

		dp[0]=1;        // 今０段目にいる。（　階段を登っていない通り数は１つ　）    （　まだ階段を登っていない　＝　0段目にいる　）

		for(int i=0;i<n;i++){  // i段目で３通りの飛び方を試す

			dp[i+1] += dp[i];   // 1段先に飛ぶ  (1段先にi段目までの通り数を足す)
			dp[i+2] += dp[i];   // 2段先に飛ぶ　(2段先にi段目までの通り数を足す)
			dp[i+3] += dp[i];   // 3段先に飛ぶ　(3段先にi段目までの通り数を足す)

		}

        /*   dp[n] に　n段目に飛んでいく通り数が入ってます　*/

		cout<< ( (dp[n]/10)/365 + 1 )<<endl;  //  1日に10回飛ぶ　＝　割る10。  １年間あたり　＝　割る365。　いい感じにしたいので１を足す
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
#define int long long
int ans[30]={},tans=0;
signed main(){
  int N;
  int dp[30]={};
  dp[0]=1;
  for(int i=1;i<=30;i++){
    //cout << i << endl;
    if(i==1) dp[i]=dp[i-1];
    else if(i==2) dp[i]=dp[i-1]+dp[i-2];
    /*else{
      int tmp=dp[i-1]+dp[i-2]+dp[i-3];
      dp[i]=tmp%3650;
      tans+=floor(tmp/3650);
      ans[i]=ans[i-1]+tans;
    }*/
    else dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
  }

  while(cin >> N && N!=0){
  cout << ceil((double)dp[N]/3650.0) << endl;
  //cout << dp[N] << endl;
}
  return 0;
}

C++: #include <cstdio>

using namespace std;

int dp[31];

int main()
{
	dp[0] = 1;

	for (int i = 1; i <= 30; ++i) {
		for (int j = 1; j <= 3; ++j) {
			if (i-j >= 0) dp[i] += dp[i - j];
		}
	}

	int n;

	while (scanf("%d", &n), n) {
		printf("%d\n", (dp[n] + 3649) / 3650);
	}
}

C++: #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>

#define INF_LL 9000000000000000000
#define INF 2000000000

#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

class Union_find{
private:
	vector<int> par;
	vector<int> rank;
	int n;

public:
	Union_find(int a){
		n = a;
		for(int i = 0;i < n;i++){
			par.push_back(i);
			rank.push_back(0);
		}
	}

	int find(int x){
		if(par[x] == x){
			return x;
		}else{
			return par[x] = find(par[x]);
		}
	}

	void unite(int x, int y){
		x = find(x);
		y = find(y);
		if(x == y) return;

		if(rank[x] < rank[y]){
			par[x] = y;
		}else{
			par[y] = x;
			if(rank[x] == rank[y]) rank[x]++;
		}
	}

	bool same(int x, int y){
		return find(x) == find(y);
	}
};

int main(void){
	int n;

	
	while(cin >> n && n){
	int a[33];
	a[0] = a[1] = 0;
	a[2] = 1;
	for(int i = 3;i < n+3;i++){
		a[i] = a[i-3] + a[i-1] + a[i-2];
	}
	int res = a[n+2]/10/365;
	if(a[n+2]% 3650 != 0)
		res ++;
	cout << res << endl;
	}
	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>

int compare_int(const void* a, const void* b) { return *(int*) a - *(int*) b; }

int n, dp[31];

int func(int p) {
	if (p == n) {
		return 1;
	}
	int cnt = 0;
	for (int i = p + 1; n >= i && 3 + p >= i; i++) {
		if (dp[i] == -1) dp[i] = func(i);
		cnt += dp[i];
	}
	return cnt;
}

int main() {
	while (scanf("%d", &n) != EOF) {
		if (n == 0) return 0;
		memset(dp, -1, sizeof(dp));
		printf("%d\n", ((func(0)+9) / 10 + 364) / 365);
	}
}

C++: #include <iostream>
using namespace std;
int main(void){
  while(true){

      int y=0,n;
      int a[31]={0};
      cin >> n;

      if(n==0)    break;

      a[1]=1;
      a[2]=2;
      a[3]=4;
      for(int i=4;i<31;i++){
          a[i]=a[i-1]+a[i-2]+a[i-3];
      }

      y=(a[n]/10)/365+1;
      cout << y << endl;

  }
}