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 <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

const int INF = 1 << 30;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy4 = {0, -1, 0, 1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };


using namespace std;


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

    while (true) {
        int N;
        cin >> N;
        if (N == 0) {
            break;
        }
        auto dp = make_v<LL>(N + 10);
        dp[0] = 1;
        FOR(i, 0, N) {
            FOR(j, 1, 4) {
                dp[i + j] += dp[i];
            }
        }

        print(ceil(ceil(dp[N], 10LL), 365LL));
    }


    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)

int main(){
  int ns[31];
  int id=0;
  vector<ll> dp(31);
  dp[0]=1;
  dp[1]=1;
  dp[2]=2;
  for (int i=3;i <= 30;i++){
      dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
  }
  while(1){
    int x;
    cin >> x;
    if (x==0) break;
    else {
      ns[id]=x;
      id++;
    }
  }
  int id2=0;
  rep(i,id){
    int tmp;
    tmp=ns[id2];
    id2++;
    //cout << dp[tmp] << endl;
    ll ans;
    ans=(dp[tmp]+10-1)/10;
    cout << (ans+365-1)/365 << endl;
  }
  return 0; 
}

C++: #include<stdio.h>
#include<iostream>
#include<string>
#include<cstdlib>

using namespace std;

int main()
{
	int a[30], n,year;
	cin >> n;
	
	a[1] = 1;
	a[2] = 2;
	a[3] = 4;

	while (1)
	{
		if (n==0)
		{
			break;
		}
			for (int  i = 4; i < n+1; i++)
		{
				a[i] = a[i - 1] + a[i - 2] + a[i - 3];

		}
			if (a[n]%3650==0)
			{
				year = a[n] / 3650;
			}
			else
			{
				year = a[n] / 3650 + 1;
			}
			
		cout << a[n]<<" "<<year<<endl;
		cin >> n;
	}
}

C++: #include<iostream>
using namespace std;
int main(){
  int fiv[31];
  fiv[0]=1;
  fiv[1]=1;
  fiv[2]=2;
  for(int i=3;i<=30;i++){
    fiv[i]=fiv[i-1]+fiv[i-2]+fiv[i-3];
  }
  while(1){
    int n;
    cin>>n;
    if(n==0) break;
    
    if(fiv[n]<=3650){
      cout<<'1'<<endl;
    }else{
      if(fiv[n]%3650==0){
	cout<<fiv[n]/3650<<endl;
      }else if(fiv[n]%3650!=0){
	cout<<(fiv[n]/3650) +1<<endl;
      }
    }
  }
}

C++: #include <stdio.h>
#include <iostream>
#include <string.h>
#include <queue>
#include <algorithm>

using namespace std;

// AOJ 0168
// KannonDou
// input n = year
// EOF = 0


int main(){

	long long a[30] = {1, 2, 4};	//a[0] = 1, a[1] = 2, a[2] = 4??§?????????
									//i+1????????§?????????????????°
	for(int i=3 ; i<30 ; i++){
		a[i] = a[i-1] + a[i-2] + a[i-3];	//a[3]???3-4,2-4,1-4????????????
											//????????°1-4??§2???3?????¢??????????????????1?????????????????????
											//????????????????????????????¨?????????????????????£??????????????????????????§?§£??????
	}
	while(1){
		int n;
		cin >> n;
		if(n==0) return 0;
		int temp = a[n-1];
		temp /= 365;
		temp /= 10;
		cout << temp + 1 << endl;
	}

	return 0;
}

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)
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};

int main(void){
	int n;
	//d[0] = 1patern d[1] = 1paten d[2] = 2patern
	int dp[41] = {1, 1, 2};
	for(int i = 3; i <= 31; i++){
		dp[i] = dp[i-3] + dp[i-2] + dp[i-1];
	}
	while(cin >> n)
		FIN(dp[n]/3650 + 1);

	return 0;
}

C++: #include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<vector>
#include<algorithm>
#include<string.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << x << endl;
using namespace std;

int main(){
    int dp[31] = {0};
    int n;

    dp[0] = 1;
    rep(i, 31){
        if(i >= 1) dp[i] += dp[i - 1];
        if(i >= 2) dp[i] += dp[i - 2];
        if(i >= 3) dp[i] += dp[i - 3];
    }
    int input;
    while(cin >> input, input){
        cout << dp[input] / 365 / 10 + 1  << endl;
    }
}

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

int main(){
	int n;
	double ans =0;
	int checkc = 0;
	int i = 4;
	double check[3] = { 1, 2, 4 };

	cin >> n;

	switch (n){
	case 1:
		ans = 1;
		break;
	case 2:
		ans = 2;
		break;
	case 3:
		ans = 4;
		break;
	default :
		while (n >= i){
			ans = check[0] + check[1] + check[2];
			i++;
			check[0] = check[1];
			check[1] = check[2];
			check[2] = ans;
		}
	}

	ans = ans / 3650;
	checkc = (int)(ans);

	if (ans > (double)(checkc)){
		checkc++;
	}
	if (ans != 0){
		cout << checkc << endl;
	}
	else{
		cout << endl;
	}

	return 0;
}