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 <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#define rep(i,n) for (int i = 0; i < (n); ++i)

using namespace std;
const int MOD = 1000000007;

typedef long long int ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;

int solve(vector<int> &dp,int n) {
    if(n==0)return 1;
    if(dp[n]!=0)return dp[n];
    dp[n] =  solve(dp,n-3) +solve(dp,n-2) + solve(dp,n-1);
    return dp[n]; 
}

int main() {
    vector<int> dp(31,0);
    int n;
    cin >> n;
    dp[1]=1;dp[2]=2;dp[3]=4;

    while(n){
        cout << ((solve(dp,n)/10)/365)+1  << endl;
        cin >> n;
    }
    return 0;
}

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

int main(){
	int n,A[40];
	queue<int> Q;
	A[0]=1;
	cin>>n;
	while(n !=0){
		for(int i=1;i<n+1;++i){
			A[i]=A[i-1];
			if(i>1){
				A[i]+=A[i-2];
			}
			if(i>2){
				A[i]+=A[i-3];
			}
		}
		A[n]=1+(A[n]/3651);
		Q.push(A[n]);
		cin>>n;
	}
	while(Q.empty()==0){
		cout<<Q.front()<<endl;
		Q.pop();
	}
}

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

int main() {
    int dp[40];
    for (int i = 0; i < 40; i++) dp[i] = 0;
    dp[0] = 1;

    for (int i = 0; i < 30; i++) {
        dp[i + 1] += dp[i];
        dp[i + 2] += dp[i];
        dp[i + 3] += dp[i];
    }
    
    int n;
    while (cin >> n) {
        if (n == 0) break;
        int cnt = dp[n];
        cout << (cnt + 10 * 365 - 1) / (10 * 365) << endl;
    }
    return 0;
}

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

int num(int n);

int main(){
  int n;
  cin>>n;
  cout << num(n)//3650+1 <<endl;
}

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

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

using namespace std;

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

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

int fact(int n){
    int res=0;
    if (n==0) {
        return 1;
    }
    if (n>=3) {
        res+=fact(n-3);
    }
    if (n>=2) {
        res+=fact(n-2);
    }
    if (n>=1) {
        res+=fact(n-1);
    }
    return res;
}

int main(){
    int i;
    while (cin>>i,i) {
        int a=0;
        a+=fact(i);
        int day=a/10;
        cout<<day/365+1<<endl;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

int main(void){
	int n;
	//d[0] = 1patern d[1] = 1paten d[2] = 2patern
	int dp[41] = {1, 1, 2};
	for(int i = 3; i <= 31; i++){
		dp[i] = dp[i-3] + dp[i-2] + dp[i-1];
	}
	while(cin >> n, n)
		FIN(dp[n]/3650 + 1);

	return 0;
}

C++: #include <cstdio>
using namespace std;
int main(){
  int n, p[31] = {0}, i, res;
  p[0] = 1;
  p[1] = 1;
  p[2] = 2;
 
 
  while(scanf("%d", &n) && n){
    for(i=3;i<=n;i++)
      p[i] = p[i-1]+p[i-2]+p[i-3];
    res=(p[n]+3649)/3650;
    printf("%d\n", res);
  }
  return 0;
}

C++: #include<iostream>
#include<cmath>
using namespace std;
int main() {
	int kaidan[31];
	kaidan[0] = 1;
	kaidan[1] = 1;
	kaidan[2] = 2;
	for (int i = 3; i <= 30; i++) {
		kaidan[i] = kaidan[i - 1] + kaidan[i - 2] + kaidan[i - 3];
	}
	int n;
	while(cin >> n&&n)
	cout << (int)ceil(kaidan[n] / 3650.0) << endl;
	
	return 0;
}

C++: #include <iostream>
using namespace std;
int dp[8192];

void goup() {
	dp[0] = 1; dp[1] = 1; dp[2] = 2;

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

int main() {
	int n;
	goup();

	while (1) {
		cin >> n;
		if (n == 0) break;
		cout << dp[n] / (365 * 10) + 1 << endl;
	}
	return 0;
}

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

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

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

using namespace std;

int dan;
int dp[31];
int solve(int i);

int main(void){
	
	while(cin >> dan, dan){
		fill_n(dp,31,-1);
		int flag = 0;
		if(solve(0) % 3650 != 0){flag++;}
		int ans = solve(0)/3650 + flag;
		cout << ans << endl;
	}
}

int solve(int num){
	if(num == dan){return 1;}
	if(num > dan){return 0;}
	if(dp[num] != -1){return dp[num];}
	int sum = 0;
	for(int i = 0; i < 3; i++){
		sum += solve(num + i + 1);
	}
	return dp[num] = sum;
}

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

int A[30];
int main() {
  A[0] = 1;
  A[1] = 1;
  A[2] = 2;

  for(int i = 3; i <= 30; i++) {
    A[i] = A[i-1] + A[i-2]+ A[i-3];
  }
  int N;
  while(cin >> N && N)
    cout << A[N]/3650 + 1 << endl;
}

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

C++: #include <bits/stdc++.h>
#include<cmath>
#define _GLIBCXX_DEBUG
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }


int main(){
vector<int>n(34);
int i=-1;
n.at(0)=1;
do{
    i++;
    cin>>n.at(i);
}while(n.at(i)!=0);

vector<int>dp(1000000);
i=0;
while (n.at(i)!=0)
{
    dp.at(n.at(i))=1;
    for(int j=n.at(i)-1;j>=0;j--){
        dp.at(j)=dp.at(j+1)+dp.at(j+2)+dp.at(j+3);
    }
    i++;
    cout<<(dp.at(0)+3649)/3650<<endl;
}
}

C++: #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ALL(A)		(A).begin(),(A).end()
#define DUMP(A)    cout<<#A<<"="<<(A)<< endl
#define SIZE(A)    (int)((A).size())
using namespace std;
typedef long long ll;

int main(){
    int n;
    for(;;){
        scanf("%d",&n);
        if(n==0) break;
        vector<int> dp(n);
        dp[0]=1;
        dp[1]=2;
        dp[2]=4;
        for(int i=3;i<n;i++){
            dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
        }
        printf("%d\n",dp[n-1]%3650==0?dp[n-1]/3650:dp[n-1]/3650+1);
    }
}