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<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define pf push_front
#define pb push_back
#define int long long
using namespace std;
const int INF=1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const int N=101;

signed main(){
  int n;
  while(cin>>n,n){
    int dp[35]={};
    dp[1]=1,dp[2]=2,dp[3]=4;
    loop(i,4,31){
      dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
    }
    cout<<dp[n]/3650+1<<endl;
  }
 return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
    int n[31];
    n[0] = 0;
    n[1] = 1;
    n[2] = 2;
    n[3] = 4;
    for(int i = 4; i < 31; i++)
    {
        n[i] = n[i-1] + n[i-2] + n[i-3];
    }
    int d;
    while(cin >> d && d != 0)
    {
        cout << n[d] / (365 * 10) + 1 << endl;
    }
    
    return 0;
}

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

integer dp[50];

int main() {
  int n;
  while (cin >> n and n) {
    for (int i = 0; i < 40; i++) {
      dp[i] = 0;
    }

    dp[n] = 1;
    for (int i = n - 1; i >= 0; i--) {
      dp[i] = dp[i+1] + dp[i+2] + dp[i+3];
    }
    cout << (dp[0] + 3649) / 3650 << endl;
  }
}

C++: #include<iostream>
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
using namespace std;
ll rr(ll y){
	if(y==0)
	return 1;
	else return y*rr(y-1);
}
ll func(ll i,ll j,ll k){
	return rr(i+j+k)/(rr(i)*rr(j)*rr(k));
}
int main(){
	ll n,sum,k;
	while(cin>>n,n){
		sum=0;
		for(ll i=0;i*3<=n;i++)
		for(ll j=0;j*2+3*i<=n;j++){
			k=n-(j*2+3*i);
			sum+=func(i,j,k);
		}
		if(sum%3650>0)
		cout<<sum/3650+1<<endl;
		else
		cout<<sum/3650<<endl;
	}
	return 0;
}

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

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef stack<int> si;
typedef deque<int> dqi;

#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define pf push_front
#define pb push_back
#define FST first
#define SEC second
#define sz(obj) ((int)(obj).size())

const int INF = 999999999;
const int MOD = 1e9 + 7;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

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

  int n;
  
  while (cin >> n, n){
    int dp[n + 5] = {0};
    int cnt = 0, ans;

    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];
    }
    ans = dp[n] / 3650;
    if (dp[n] % 3650) ans += 1;
    cout << ans << endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)

int solve(int n) {
    vector<int> dp = {1, 1, 2};
    for(int i = 3; i <= n; i++) {
        dp.push_back(dp[i - 3] + dp[i - 2] + dp[i - 1]);
    }
    int day = (dp[n] + 9) / 10;
    return (day + 364) / 365;
}

int main() {
    vector<int> n;
    int tmp = 100000;
    while(true) {
        cin >> tmp;
        if(tmp == 0) break;
        n.push_back(tmp);
    }
    REP(i, n.size()) cout << solve(n[i]) << endl;
}

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

#define SIZE 9

using namespace std;

int main(){
	int step[31]={0};
	int n;
	step[0] = 1;
	step[1] = 1;
	step[2] = 2;
	for(int i=3;i<=30;i++){
		step[i]=step[i-3]+step[i-2]+step[i-1];
	}
	for(int i=0;i<=30;i++){
		step[i]/=10;
	}
	while(cin>>n,n){
		if(step[n]!=0 && step[n]%365==0){
			cout<<step[n]/365<<endl;
		}else{
			cout<<step[n]/365+1<<endl;
		}
	}
	return 0;
}

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

using namespace std;

int main( void )
{
	int n, m[31];
	fill(m, m+31, 0);
	m[0] = 1;
	for(int i=0; i < 30; ++i) {
		if(!m[i]) continue;
		for(int j=1; j <= 3; ++j) {
			int ii = i + j;
			if(ii <= 30) {
				m[ii] += m[i]; 
			}
		}
	}
	for(int i=0; i <= 30; ++i) m[i] /= 10;
	while(cin >> n, n) {
		cout << m[n] / 365 + ((m[n] == 0 || m[n]%365)? 1 : 0) << endl;
	}
	return 0;
}

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

int main(void){
	const int ofDay = 10;
	const int MAXN = 30;
	const int TOBIN = 3;
	const int YEAR = 365;
	int dp[MAXN+1];
	int tobi[TOBIN] = {1,2,3};
	
	// init
	for(int i=1; i<=MAXN; i++)
		dp[i] = 0;
	dp[0] = 1;

	// 全通り計算
	for(int i=1; i<=MAXN; i++){
		for(int j=1; j<=TOBIN; j++){
			if( i+j <= MAXN )
				dp[i+j] += dp[i];
		}
	}

	// 年数計算
	for(int i=1; i<=MAXN; i++){
		dp[i] = dp[i] / ofDay / YEAR;
		dp[i] += 1;
	}

	// 対話
	while( true ){
		int n;
		cin >> n;
		if( n == 0 )
			break;

		cout << dp[n] << endl;
	}

	return 0;
}

C++: #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
int dp[31];//i段目の登り方の総数
int main()
{
  int n;
  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(cin>>n,n){
    int day;
    int ans;
    if(dp[n]%10)
      day =dp[n]/10+1;
    else
      day =dp[n]/10;
    if(day%365)
      ans =(day/365)+1;
    else
      ans =(day/365);
    cout <<ans<<endl;
  }
  return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    while(1)
    {
        int n;
        int sta[35]={0};
        sta[0]=1;
        cin>>n;
        if(n==0)break;
        for(int i=0;i<n;i++)
        {
            sta[i+1]+=sta[i];
            sta[i+2]+=sta[i];
            sta[i+3]+=sta[i];
        }
        cout<<(((sta[n]+9)/10)+364)/365<<endl;
    }
    return 0;
}