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 <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <cstdio>
#include <cctype>
#include <queue>
#include <complex>
#include <climits>

typedef long long ll;

using namespace std;



int main(){
	int n;
	int dp[40];
	
	dp[0] = 1, dp[1] = 1, dp[2] = 2, dp[3] = 4;
	for(int i=4; i<35; i++){
		dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
	}

	while(cin >> n){
		if(!n) break;
		cout << (dp[n] + 3649) / 3650  << endl;
	}


    return 0;
}

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

int main(){
	int dp[31] = {1, 1, 2};
	for(int i = 3; i <= 30; ++i){
		dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
	}
	int n;
	while(scanf("%d", &n), n){
		printf("%d\n", (dp[n] + 3649) / 3650);
	}
}

C++: #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
using namespace std;

int main(){
    int n,step[35] = {0};

    step[0] = 1;
    rep(i,30){
        step[i + 1]+=step[i];
        step[i + 2]+=step[i];
        step[i + 3]+=step[i];
    }

    while(cin >> n, n){
        cout << step[n] / 3650 + ((step[n] % 365) > 0) << endl;
    }
}

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++: /*
　　こんにちは。あたしはｶｳｶﾞｰﾙ。
　　redcoderになるためAtCoderを巡る旅をしてます。

　　　 　 ＿_
　　　 ヽ|＿_|ノ　　　　ﾓｫ
　　　　||‘‐‘||ﾚ　　_)_, ―‐ 、
　　　　/(Ｙ (ヽ＿ /・ ヽ　　 ￣ヽ
　　　　∠ ＿ ゝ　 ｀^ヽ ﾉ.::::_(ノヽ
　　　　 _/ヽ　 　　  /ヽ￣￣/ヽ
*/

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl

#define rep(i, n) REP(i, 0, n)                  // 0, 1, ..., n-1
#define REP(i, x, n) for(int i = x; i < n; i++) // x, x + 1, ..., n-1
#define FOREACH(x, a) for(auto &(x) : (a))

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()

#define COUT(x) cout << (x) << endl

template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(1) {
        int n;
        cin >> n;
        if(n == 0) break;
        vector<ll> dp(31);

        dp[0] = dp[1] = 1;
        dp[2]         = 2;

        for(int i = 3; i <= 30; i++) {
            dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
        }
        cout << (dp[n] / 10 / 365 + 1) << endl;
    }
}

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

#if 0
所用時間:

感想:

#endif

int N; int A[30];

int main(){
  while(cin >> N && N){
    A[0] = 1;
    A[1] = 1;
    A[2] = A[1] + A[0];
    if(N > 2){
      for(int i = 3; i <= N; ++i){
        A[i] = A[i-1] + A[i-2] + A[i-3];
      }
    }
    cout << (A[N]/10+364)/365 << endl;
  }
}

C++: #include<iostream>
int n,s[33]={1},t;main(){for(;n<30;s[n]+=t,s[n+1]+=t,s[n+2]+=t)t=s[n++];for(;std::cin>>n,n;)printf("%d\n",(s[n]-n)/10/365+1);}

C++: #include <iostream>

using namespace std;

typedef unsigned int U;
U n;
U memo[31];

U dfs(U num)
{
	
	U sum = 0;

	if(memo[num] != -1)
	{
		return memo[num];
	}

	if(num == n)
	{
		return 1;
	}

	if(num < n)
		sum += dfs(num + 1);

	if(num < n)
		sum += dfs(num + 2);

	if(num < n)
		sum += dfs(num + 3);

	memo[num] = sum;

	return sum;
}

int main()
{

	while(1)
	{
		cin >> n;

		for(int i = 0; i <= 31; i++)
		{
			memo[i] = -1;
		}

		if(n == 0)
		{
			break;
		}

		cout << dfs(0)/10/365+1 << endl;
	}
}

C++: #include <iostream>

using namespace std;

main(){
  int dp[31];
  for(int i=0;i<31;i++){
    dp[i]=0;
  }
  dp[0]=1;
  for(int i=0;i<31;i++){
    if(i<30) dp[i+1]+=dp[i];
    if(i<39) dp[i+2]+=dp[i];
    if(i<28) dp[i+3]+=dp[i];
  }

  int n;
  while(1){
    cin >> n;
    if(n==0) break;

    if(dp[n]%365==0){
      cout << dp[n]/3650 << endl;
    }else{
      cout << dp[n]/3650+1 << endl;
    }
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int dp(int n){
    if(n==1) return 1;
    if(n==2) return 2;
    if(n==3) return 4;
    return dp(n-1) + dp(n-2) + dp(n-3);
}

int main(void){
    int n;
    while(cin >> n){
        if(n == 0) break;
        cout << dp(n) / 3650 + 1 << endl;
    }
    return 0;
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>

using namespace std;

int main(){

	long long data[31];

	data[1] = 1;
	data[2] = 2;
	data[3] = 4;

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

	int n,num;

	while(true){
		scanf("%d",&n);
		if(n == 0)break;

		num = 0;

		num += data[n]/3650;
		if(data[n]%3650 > 0)num++;

		printf("%d\n",num);
	}

    return 0;
}

C++: #include<iostream>
using namespace std;
int dp[50];
int main(){
  int n;
  while(cin>>n,n){
    dp[0]=1;
    dp[1]=1;
    dp[2]=2;
    for(int i=3;i<=n;i++){
      dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
    }
    cout<<(dp[n]+3649)/3650<<endl;
  }
  return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<algorithm>

#define N_MAX 30

int main(){
	while (1){
		int n, dp[N_MAX + 1];
		scanf("%d", &n);
		if (n == 0)
			break;
		for (int i = 0; i <= n; ++i)
			dp[i] = 0;

		for (int i = 1; i <= 3; ++i){
			for (int j = 1; j <= n; ++j){
				if (j >= i){
					dp[j] = std::max(dp[j], dp[j - i] + 1);
				}
			}
		}
		printf("%d", dp[n]);
	}
	return 0;
}