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 n;
int saiki (int now)
{
	if (now == n)return 1;
	if (now > n)return 0;
	int res = 0;
	res = saiki(now+1)
	+ saiki(now+2)
	+ saiki(now+3);
	return res;	
}
int main ()
{
	while(true)
	{
		cin >> n;
		if(n==0)break;
		int answer = saiki (0);
		cout << answer/3650+1 << endl;
	}

}

C++: #include <cstdio>

int n;
int s[31];

int main(){
	s[0] = 1;
	for(int i = 0; i < 31; i++){
		for(int j = 1; j <= 3; j++){
			if(i-j < 0) break;
			s[i] += s[i-j];
		}
	}
	while(scanf("%d", &n),n){
		if(s[n]%3650==0) printf("%d\n", s[n]/3650);
		else printf("%d\n", s[n]/3650+1);
	}
}

C++: #include<iostream>

using namespace std;

long long memo[100], ans;

int N;

int main() {
	while (cin >> N) {
		memo[1] = 1;
		memo[2] = 2;
		memo[3] = 4;
		for (int i = 4; i <= N; i++) {
			memo[i] += memo[i - 1] + memo[i - 2] + memo[i - 3];
		}
		cout << memo[N] / (10 * 365) + 1 << 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++: #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cstdlib>

using namespace std;

inline int to_int(string s) {int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string to_str(T x) {ostringstream sout; sout << x; return sout.str();}

typedef long long ll;

int main()
{
	int dp[32] = {0}, n;
	dp[0] = 1;
	dp[1] = 1;
	dp[2] = 2;

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

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

C++: #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

typedef vector<unsigned int>vec;
typedef vector<vec> mat;

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

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

ll dp[31];

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

    dp[1]=1;
    dp[2]=2;
    dp[3]=4;
    for(int i=4;i<31;i++) dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
    while(true){
        int d;cin>>d;
        if(d==0) return 0;
        ll ans = dp[d]/3650;
        if(dp[d]%3650>0) ans++;
        cout<<ans<<endl;
    }
}

C++: #include <iostream>
using namespace std;
int num(int n);
int main(){
  int n;cin >> n;
  cout << num(num(n)) <<endl;
}

int num(int n){
  if(n<1)return 0;
  if(n=1)return 1;
  return num(n-1)+num(n-2)+num(n-3);
}

C++: #include <iostream>

int n;
int cmb;
int dp[31];

/*
int func(int now){
  if(now > n)
    return 0;
  if(now == n){
    dp[now] = 1;
    return 1;
  }


  return func(now+1) + func(now+2) + func(now+3);
}
*/

int func(int now){
  int a[3];
  if(now < 0){
    return 0;
  }
  if(now == 0){
    return 0;
  }
  if(now == 1){
    return 1;
  }
  if(now == 2){
    return 2;
  }
  if(now == 3){
    return 4;
  }

  for(int i=1; i <= 3; i++){
    if(dp[now-i] != -1){
      a[i-1] = dp[now-i];
    }else{
      a[i-1] = func(now-i);
      dp[now-i] = a[i-1];
    }
  }

  return a[0] + a[1] + a[2];

}

int main(void){
  while(1){
    int ans;
    std::cin >> n;

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

    if(n == 0){
      return 0;
    }

    cmb = 0;
    ans = func(n);

    std::cout << ans / 10 / 365 + 1 << std::endl;
  }
}

C++: #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second

#define INF 2147483600

long dp[31];

int main(){
  fill(dp, dp+31, 0);
  dp[0]=1;
  for(int i=1; i<=30; i++){
    for(int j=1; j<=3; j++){
      if(i-j>=0) dp[i] += dp[i-j];
    }
  }dbg(dp[1]);
  int n;
  while(cin>>n, n){
    long res = (((dp[n]+9)/10)+364)/365;
    cout<<res<<endl;
  }

  return 0;
}

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++: #include<iostream>
using namespace std;
int main(){
	int a[32], b[32],c;
	int d = 0;
	a[0] = 1; a[1] = 1; a[2] = 2;
	b[0] = 1; b[1] = 1; b[2] = 1;
	for (int x = 3; x <= 30; x++){
		a[x] = a[x - 1] + a[x - 2] + a[x - 3];
		if (a[x] % 3650 == 0)b[x]=a[x]/3650;
		else b[x]=a[x]/3650+1;
	}
	while (1){
		cin >> d;
		if (d == 0)break;
		cout << b[d]<<endl;

	}
	return 0;
}

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

int num(int n);

int main()
{
  string s;
  cin >> s;
  int n = std::stoi(s);
  cout << num(n) <<endl;
}

int num(int n){
  if(n<0)return 0;
  return num(n-1)+num(n-2)+num(n-3);
}

C++: #include <iostream>

using namespace std;

main(){
  long long dp[31];
  for(int i=0;i<31;i++){
    dp[i]=0;
  }
  dp[0]=1;
  for(int i=0;i<31;i++){
    int t=i+1;
    if(t<31) dp[t]+=dp[i];
    t++;
    if(t<31) dp[t]+=dp[i];
    t++;
    if(t<31) dp[t]+=dp[i];
  }

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

    if(dp[n]%3650==0){
      cout << dp[n]/3650 << endl;
    }else{
      cout << dp[n]/3650+1 << endl;
    }
  }
  return 0;
}

C++: #include<iostream>
using namespace std;
int Kannondou(int n){
	int dp[4] = {1,2,4,0};

	if(n<=3)
		return 1;

	for(int i = 3; i < n; ++i){
		dp[ 3 ] = dp[ 2 ] + dp[ 1 ] + dp[ 0 ];
		dp[ 0 ] = dp[ 1 ];
		dp[ 1 ] = dp[ 2 ];
		dp[ 2 ] = dp[ 3 ];
	}
	return ( dp[ 3 ] - 1 ) / 3650 + 1;
}
int main(){
	while(true){
		int n;

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

		cout << Kannondou( n ) << endl;
	}
	return 0;
}