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>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1'000'000'007;

template <typename T>
void print(const T &v)
{
    for (int i = 0; i < v.size(); i++)
    {
        if (i)
            cout << ' ';
        cout << v[i];
    }
    cout << endl;
}

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

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

const int MAX = 100010;

int main()
{
    while (true)
    {
        int n;
        cin >> n;
        if (n == 0)
        {
            return 0;
        }
        ll dp[n + 5];
        dp[0] = 1;
        dp[1] = 1;
        dp[2] = 2;
        for (int i = 3; i <= n; i++)
        {
            dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
        }
        cout << (((dp[n] + 9) / 10) + 364) / 365 << endl;
    }
}

C++: #include <iostream>
using namespace std;
int count(int);
int main(void){
    int n,x;
    while(1){
        cin >> n;
        if(n==0) break;

        x=count(n)/10;
        cout << x/365+1 << endl;
    }
}

int count(int n){
    if(n==1) return 1;
    else if(n==2) return 2;
    else if(n==3) return 4;
    else return count(n-1)+count(n-2)+count(n-3);
}

C++: // 0168_Kannondou.cpp
//
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX_N = 30;
ll dp[MAX_N+1];
int n;
int main() {
  dp[1]=1, dp[2]=2, dp[3]=4;
  for(int i=4; i<=MAX_N; ++i) {
    dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
  }

  while(cin >> n, n){
    ll day = (dp[n] + 10-1)/10;
    ll year = (day + 365-1)/365;
    cout << year << endl;
  }
  return 0;
}

C++: #include<iostream>

using namespace std;

int ProgressNumberOfYears(int step_num, int step_kind)
{

  if(step_num == 0)
    return 1;
  else if(step_num < 0)
    return 0;

  int count = 0;

  for(int i = 1; i < 4; ++i)
    {

      count = count + ProgressNumberOfYears(step_num - i,i);

    }

  return count;

}

int main()
{

  int step_num;

  cin >> step_num;

  while(cin >> step_num && step_num != 0)
    {

      cout << (ProgressNumberOfYears(step_num,0)/10)/365 + 1 << endl;

    }

  return 0;

}

C++: #include<iostream>
#include<math.h>
using namespace std;
long long dp[30];

void tribonacci(int n){
    if (n==1) {
        dp[n-1] = 1;
    } else if (n==2) {
        dp[n-1] = 2;
    } else if (n==3) {
        dp[n-1] = 4;
    } else {
        dp[n-1] = dp[n-2] + dp[n-3] + dp[n-4];
    }
}

int main() {
    int n;
    double days;
    long long year;
    for(int i=1;i<=30;i++){
        tribonacci(i);
    }
    while(1){
        cin >> n;
        if (n==0) break;
        days = dp[n-1]/10;
        year = floor(days/365)+1;
        cout << year << endl;
    }
    return 0;
}

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

using namespace std;


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

}

C++: #include<iostream>
int x[100];

using namespace std;
int count(int step){
  int ret = 0;
  if(step < 0)return 0;
  if(step == 0)return 1;
  if(x[step] > 0)return x[step];
  for(int i = 1;i <= 3;i++){
    ret += count(step - i);
  }
  return x[step] = ret;
}

int main(){
  int n;
  while(cin >> n && n > 0){
    cout << ((count(n)+9) / 10 + 364)/365 << endl;
  }
}

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

int main(){
	while(true){
		int n;
		int dp[35] = {0};
		dp[1] = 1;
		dp[2] = 1;
		dp[3] = 1;

		cin >> n;
		if(n == 0){
			break;
		}

		for(int i = 1; i <= n; i++){
			dp[i + 1] += dp[i];
			dp[i + 2] += dp[i];
			dp[i + 3] += dp[i];
		}

		dp[n] /= 10;
		dp[n] /= 365;
		dp[n]++;

		cout << dp[n] << endl;

	}
}

C++: #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
ll dp[31];
void mainmain(){
	dp[1]=1;
	dp[2]=2;
	dp[3]=4;
	reep(i,4,31){
		rep(j,3){
			dp[i]+=dp[i-j-1];
		}
	}
	// reep(i,4,7){
		// cout<<dp[i]<<endl;
	// }
	// rep(i,35){
		// cout<<i<<" "<<i*3650<<endl;
	// }
	// rep(i,31){
		// cout<<i<<" "<<dp[i]<<endl;
	// }
	int n;
	while(cin>>n,n){
		ll t=dp[n]-1;
		// cout<<t<<endl;
		t/=3650;
		cout<<t+1<<endl;
	}
	// int tt=7299;
	// tt/=3650;
	// cout<<tt+1<<endl;
}

}
main() try{
    mainmain();
}
catch(...){
}

C++: #include <iostream>
using namespace std;
int a,cou,sum,now;

void dfs(int now){
  if(now==a)cou++;
  if(now+1<=a){
    dfs(now+1);
  }
  if(now+2<=a){
    dfs(now+2);
  }
  if(now+3<=a){
    dfs(now+3);
  }
}

int main(){
  while(1){
    cin >> a;
    if(a==0)break;
    cou=0;
    now=0;
    dfs(now);
    if(cou%10!=0)cou=cou/10+1;
    else cou=cou/10;
    if(cou%365!=0)cou=cou/365+1;
    else cou=cou/365;
    cout <<cou<<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);
//	}
//}

int main() {
	int n, dp[33] = {};
	dp[30] = 1;
	for (int i = 29; 0 <= i; i--) {
		dp[i] = dp[i + 1] + dp[i + 2] + dp[i+3];
	}

	while (1) {
		scanf("%d", &n);
		if (!n)return 0;
		printf("%d\n", ((dp[30 - n] + 9) / 10 + 364) / 365);
	}
	return 0;
}

/*

dp[i] = {dp[i+1]+dp[i+2]+dp[i+3] ????????????

*/