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>
using namespace std;
int main()
{
	int dp[31]={},n,ans;
	dp[1]=1;
	dp[2]=2;
	dp[3]=4;
	for(int i=4;i<=30;i++){
		dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
	}
	//for(int i=0;i<=30;i++)cout<<dp[i]<<endl;
	while(cin>>n){
		ans=dp[n]/3650;
		ans+=dp[n]%3650!=0?1:0;
		cout<<ans<<endl;
	}
    return 0;
}

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

int memo[M];

int main(){
	int n,ans;
	
	memo[0]=1;
	memo[1]=1;
	memo[2]=2;
	
	for(int i=3;i<M;i++){
		memo[i]=memo[i-1]+memo[i-2]+memo[i-3];
	}
	
	while(cin>>n){
		if(n==0)break;
		cout<<memo[n]/(365*10)+1<<endl;
	}
	
	return 0;
}

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

int main() {

    long long int dp[34] = {0};

    dp[0] = 1;

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

    for(int i=0;i<31;i++){
        dp[i] = dp[i]/10;
    }

    while(1){

        int n;

        cin >> n;

        if(n==0) break;

        int ans = dp[n]%365==0 ? dp[n]/365 : dp[n]/365+1;
        
        if(ans==0) ans = 1;

        cout << ans << endl;

    }


    return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

	int n;
	int dp[32];
	int ans;

	while(1){

		cin >> n;

		if(n==0){break;}

		for(int i=1; i<=n; i++){
			if(i==1 ||  i==2 ){dp[i] = i;}
			else if(i==3){dp[i] = 4;}
			else{
				dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
			}
		}

		ans = dp[n] / 3650;
		if(dp[n]%3650 != 0){
			ans++;
		}

		cout << ans << endl;

	}

	return 0;
}

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

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))

const int INF = -1;

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

ll dp[31];
int N;

void solve() {
    dp[1] = 1;
    dp[2] = 2;
    dp[3] = 4;
    for (int i = 4; i <= 30; ++i) dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
}

int main() {
    clr(dp, -1);
    solve();
    while (cin >> N, N) {
        cout << (dp[N]/10)/365+bool(dp[N]%3650) << endl;
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

int a[31];
int func(int n)
{
	if(a[n] > 0){
		return a[n];
	}
	
	return a[n] = func(n-1)+func(n-2)+func(n-3);
}

int main()
{
	int n, s;
	a[0] = a[1] = 1;
	a[2] = 2;
	a[30] = func(30);
	
	while(cin>>n && n){
		s = 0;
		for(int i = 1; i <= n; i++){
			s += a[i];
		}
		
		cout << a[n]/3650+1 << endl;
	}
	
	return 0;
}

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

int dp[40];

int main(void) {
    int n;
    dp[0] = 1;
    dp[1] = 2;
    dp[2] = 4;
    for (int i = 3; i < 40; i++) {
        dp[i] += (dp[i-1]+dp[i-2]+dp[i-3]);
    }
    while (cin >> n, n) {
        int year = 1;
        while (year*365*10 < dp[n-1]) {
            year++;
        }
        cout << year << endl;
    }

    return 0;
}

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

using namespace std;

int main(){

  int n;

  while(cin>>n, n){
    int a[40]={};
    for(int i=0;i<=n;i++){
      if(i==0) a[i]=1;
      if(i==1) a[i]=a[i-1];
      if(i==2) a[i]=a[i-1]+a[i-2];
      if(i>2) a[i]=a[i-1]+a[i-2]+a[i-3];
    }

    cout<<ceil((double)a[n]/10/365)<<endl;
  }

  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
	int kaidan[40];
	kaidan[1] = 1;
	kaidan[2] = 2;
	kaidan[3] = 4;
	for(int i = 4; i <= 30; i++){
        kaidan[i] = kaidan[i-1] + kaidan[i-2] + kaidan[i-3];
	}
    while(1){
        int n;
        cin >> n;
        if(n == 0) break;
        cout << kaidan[n] / 3650 + 1 << endl;
    }

	return 0;
}

C++: #define _USE_MATH_DEFINES 
#include<iomanip> 
#include<cmath>  
#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<queue>
#include<deque>
#include<stack>
using namespace std;
typedef long long ll;
#define repi(i,a,b) for(ll i = (ll)(a) ; i < (ll)(b) ; i++)
#define repd(i,a,b) for(ll i = (ll)(a) ; i > (ll)(b) ; i--)
#define rd(x) cin >> x
#define wr(x)  cout << x
#define wrln(x) cout << x << endl
#define wl() cout << endl
const ll MAX_10p5 = 100010;
const ll MAX_10p9 = 1000000010;
const ll MAX_10p18 = 1000000000000000010;
const ll MOD = 1000000007;
const ll m4x[4] = { 1,0,-1,0 };
const ll m4y[4] = { 0,1,0,-1 };
const ll m8x[8] = { 1,1,0,-1,-1,-1,0,1 };
const ll m8y[8] = { 0,1,1,1,0,-1,-1,-1 };
const ll m9x[9] = { 1,1,0,-1,-1,-1,0,1,0 };
const ll m9y[9] = { 0,1,1,1,0,-1,-1,-1,0 };

struct edge {
	ll from, to, cost;
	bool operator<(const edge& right) const {
		return cost < right.cost;
	}
};
struct point {
	ll x, y;
	bool operator<(const point& right) const {
		return x == right.x ? y < right.y : x < right.x;
	}
};

///////////////////////////////////////////////////////////////////////////////////////

int main() {
	ll dp[35] = {};
	dp[0] = dp[1] = 1;
	dp[2] = 2;
	repi(i, 3, 31) {
		dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
	}
	while (1) {
		ll n;
		rd(n);
		if (n == 0) break;
		ll ans = ((dp[n] + 9) / 10 + 364) / 365;
		wrln(ans);
	}
	return 0;
}