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<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#include<cctype>

#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()

using namespace std;

typedef long long LL;
typedef vector<int> VI;
typedef vector<vector<int> > VII;
typedef pair<int,int> PII;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

int n;
LL memo[31];

LL solve(int cnt){
	if(memo[cnt] != -1) return memo[cnt];
	if(cnt >= n) return cnt > n? 0 : memo[cnt] = cnt == n;
	LL res1 = solve(cnt + 1);
	LL res2 = solve(cnt + 2);
	LL res3 = solve(cnt + 3);
	return memo[cnt] = res1 + res2 + res3;
}

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);
	while(1){
		rep(i,31)
			memo[i] = -1;
		cin >> n;
		if(n == 0) break;
		LL ans = solve(0);
		ans = (ans + 10 - 1) / 10;
		ans = (ans + 365 - 1) / 365;
		cout << ans << endl;
	}

	return 0;
}

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

int main(){

	int n, p[30], s;
	
	p[0] = 1;
	p[1] = 1;
	p[2] = 2;
	p[3] = 4;
	for(int i=4; i<=30; i++){
		p[i] = p[i-1] + p[i-2] + p[i-3];
cout << i << " : " << p[i] << endl;
	}
	for(int i=0; i<30; i++){
		s = p[i] % 3650;
		if(s == 0) p[i] /= 3650;
		else p[i] = (p[i] - s) / 3650 + 1;
	}

	while(cin >> n){
		if(n == 0) break;
		cout << p[n] << endl;
	}

	return 0;

}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
  unsigned long long ary[35] = {0};
  int n; 
  ary[0] = 1; 
  ary[1] = 1;
  ary[2] = 2;
  loop(i,3,35){
    ary[i] = ary[i-1] + ary[i-2] + ary[i-3];
    //  cout<<i<<" "<<ary[i]<<" "<<ary[i]/365<<endl;
  }

 
  while(cin>>n,n){
    cout<<ary[n]/3650+(ary[n]%3650?1:0)<<endl;
  }
  cout<<endl;
  


}

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

long long dp[31];
int main(){
	
	dp[0]=0;
	dp[1]=1;
	dp[2]=2;
    dp[3]=4;
int i=4;
	while(i<31){
		dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
        //cout << i << endl;
        i++;
	}
    for(;;){
	int n;
	cin >> n;
    if(n==0)return 0;
     if(dp[n]%3650==0)
	   cout << (dp[n]/3650);
     else
       cout << (dp[n]/3650)+1;
}
}

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

int memo[300];
int dp(int num);

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

		memset(memo, -1, sizeof(memo));

		cout << (int)ceil(dp(n) / 3650.0) << endl;
		//cout << dp(n) << endl;
		
	}

	return 0;
}

int dp(int num){
	if(num < 0) return 0;
	if(memo[num] != -1) return memo[num];
	if(num <= 1) return memo[num] = 1;

	return memo[num] = dp(num-1) + dp(num-2) + dp(num-3);
}

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

int f(int n) {    // 再帰関数
    if(n == 1) return 1;
    if(n == 2) return 2;
    if(n == 3) return 4;
    return f(n-1) + f(n-2) + f(n-3);
}

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

C++: #include <cstdio>


int dp[35];


int main(){
    int n;
    while(scanf("%d",&n)&&n>0){
        for(int i=0;i<=34;i++) dp[i]=0;
        dp[0]=1;
        for(int cur=0;cur<=n;cur++){
            for(int step=1;step<=3;step++) dp[cur+step]+=dp[cur];
        }



        printf("%d\n",(dp[n]/3650)+(dp[n]%3659?1:0));
    }


    return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int a[31] = { 0, 1, 2, 4 };
    for( int i=4; i<=30; ++i ) {
        a[i] = a[i-1] + a[i-2] + a[i-3];
    }

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

        cout << ( a[n] < 10 ? 1 : (( a[n] / 10 / 365 ) + ( a[n] / 10 % 365 != 0 ) )) << endl;
    }
}

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

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n;
	while(cin >> n && n != 0){
	
	int dp[31];
	
	dp[1] = 1;
	dp[2] = 2;
	dp[3] = 4;
	
	for(int i = 4; i <= n; ++i){
		dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
	}
	
	int sum = dp[n];
	
	if(sum % 10 == 0)
		sum /= 10;
	else
		sum = sum / 10 + 1;
	
	if(sum % 365 == 0)
		sum /= 365;
	else
		sum = sum / 365 + 1;
	
	cout << sum << endl;
	}
}

C++: #include <iostream>

using namespace std;

int p[100];

int main(){
	p[1] = 1;
	p[2] = 2;
	p[3] = 4;
	for(int i = 4; i <= 30; i++){
		p[i] = p[i-1] + p[i-2] + p[i-3];
	}

	int n;
	while(cin >> n, n){
		cout << p[n]/3650+1 << endl;
	}

	return 0;
}

C++: #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
#include <complex>
#include <functional>
using namespace std;
typedef pair<int,int> P;

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

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

int allSearch(int n) {
  int a;
  if(n <= 1) {
    a = 1;
  } else if(n <= 2) {
    a = allSearch(n-2) + allSearch(n-3);
  } else {
    a = allSearch(n-1) + allSearch(n-2) + allSearch(n-3);
  }
  return a;
}

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

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

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

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

int main(){
  int n,dp[MAX];

  dp[1] = 1; dp[2] = 2; dp[3] = 4;
  for(int i = 4 ; i < MAX ; i++)
    dp[i] = dp[i-1]+dp[i-2]+dp[i-3];

  while(cin >> n,n){
    cout << dp[n]/365/10+1 << endl;
  }

  return 0;
}

C++: #include<iostream>

using namespace std;

long long
search(int n,int count){
	int i,j;
	if(n>2){
		count=search(n-3,count);
	}
	if(n>1){
		count=search(n-2,count);
	}
	if(n>0){
		count=search(n-1,count);
	}
	if(n==0)return count+1;
	//	return count;
}
int
main(){
	int d;
	while(true){
		cin>>d;
		if(!d)break;
		cout<<(search(d,0)/10)/365+1<<endl;;
	}
	return 0;
}