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;
long dp[31];
main()
{
    dp[0]=1;
    for(int i=1;i<=30;i++)
    {
        for(int j=1;j<=3&&i-j>=0;j++)dp[i]+=dp[i-j];
    }
    int n;
    while(cin>>n,n)cout<<(dp[n]-1)/365+1<<endl;
}

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

long long ways[31];

long long howManyWays(int n) {
    if (ways[n]) {
        return ways[n];
    }
    if (n <= 0) {
        return ways[0] = 1;
    } else if (n == 1) {
        return ways[1] = howManyWays(0);
    } else if (n == 2) {
        return ways[2] = howManyWays(1) + howManyWays(0);
    } else {
        return ways[n] = howManyWays(n - 1) + howManyWays(n - 2) + howManyWays(n - 3);
    }
}

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

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

using namespace std;

int main(){
	int dp[33]={0};
	
	dp[0]=1;
	for(int i=0;i<33;i++){
		if(i-1>=0)dp[i]+=dp[i-1];
		if(i-2>=0)dp[i]+=dp[i-2];
		if(i-3>=0)dp[i]+=dp[i-3];
	}
	
	while(1){
		int n;
		cin>>n;
		if(n==0)break;
		
		printf("%d\n",(dp[n]+3649)/3650);
	}
}

C++: #include<iostream>

using namespace std;

int main(){

	int n;

	while(n>0){

		cin >> n;

		int set = n / 3;
		int r = n % 3;
		int total = 0;

		while(set > 0){
			if(set == n / 3){total += 4;}
			else{
				total = total * 4 * 2 - 8;
			}
			set--;
		}

		if(n < 3){
			total += r;
		}
		else{
			if(r == 1){
				total = total * 2 - 1;
			}
			else if(r == 2){
				total = total * 4 - 3;
			}
		}

		int ans = total / 3650;

		if(total % 3560 != 0){
			ans++;
		}

		cout << ans << endl;

	}

	return 0;
}

C++: #include <iostream>

using namespace std;
int N;
int A_count(int x){
	if (x == 0){
		return 1;
	}else if (x == 1){
		return 1;
	}else if (x == 2){
		return 2;
	}else{
		return (A_count(x-1) + A_count(x-2) + A_count(x-3));
	}
}

int main() {
	while (cin >> N && N){
		cout << (((A_count(N)+9)/10)+364)/365 << endl;		
	}
	return 0;
}

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

int main(){
	int n;
	int m[30] = {1, 1, 2};

		for(int i= 3; i < 30; i++){
			m[i] = m[i-1] + m[i-2] + m[i-3];
		}
	while(cin >> n, n){
		cout << m[n] / (365 * 10) + 1 << endl;
	}
}

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

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

using namespace std;

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

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

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

    return 0;
}

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

int stair[31];
int n;

void solve(){
	for(int i=2; i<=30; i++)
		stair[i] = 0;
	stair[1] = 1;
	stair[2] = 1;
	stair[3] = 1;
	for(int i=1; i<=27; i++){
		stair[i+1] += stair[i];
		stair[i+2] += stair[i];
		stair[i+3] += stair[i];
	}
	stair[29] += stair[28];
	stair[30] += stair[28];
	stair[30] += stair[29];
}

int main(){
	solve();
	int ans;
	while(true){
		cin >> n;
		if(!n)
			return 0;
		ans = stair[n]/10;
		if(stair[n]%10)
			ans++;
		if(ans%365)
			ans += 365;
		ans /= 365;
		cout << ans << endl;
	}
}

C++: #include <cstdio>
#include <cmath>
#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){
	memo[0] = memo[1] = 1;
	memo[2] = 2;

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

	return memo[num];
}

C++: #include<iostream>

using namespace std;

int main(){

	int n;

	int memo[100];

	while(1){

		cin>>n;

		if(n==0) break;

		memo[0]=1;
		memo[1]=1;
		memo[2]=2;
		for(int i=3;i<n;i++){
			memo[i]=memo[i-1]+memo[i-2]+memo[i-3];
		}
		cout<<memo[n]/ 10 / 365 + 1<<endl;
	}
}

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

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

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>

#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repn(i,n,m) for(int i=n;i<m;i++)
#define repn1(i,n,m) for(int i=n;i<=m;i++)
using namespace std;

int main(){
????????????int n;
????????????while(cin >> n, n){
	int dp[100] = {0};
	
	dp[1] = 1;
	dp[2] = 2;
	dp[3] = 4;

	repn(i, 4, 30) dp[i] = dp[i-1] + dp[i-2] + dp[i-3];

	

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

	return 0;
}

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

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

C++: #include<iostream>

using namespace std;

int main(){
  int n, i;
  while(cin >> n && n != 0) {
    int dp[n+1] = {};
    dp[1] = 1;
    dp[2] = 2;
    dp[3] = 4;

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

    i = 0;
    
    while(dp[n] > 0) {
      dp[n]-=3650;
      i++;
    }
    
    cout <<  i  << endl;
  }
  
  return 0;
}

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

using namespace std;

int main()
{
	int n;
	vector<int> num;
	do
	{
		cin >> n;
		num.push_back(n);
	}while (n != 0);
	num.pop_back();

	int dp[30];
	dp[0] = 1;
	dp[1] = 2;
	dp[2] = 4;

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

	for (auto it = num.begin(); it != num.end(); it++)
	{
		cout << dp[*it - 1]/3650 + 1 << endl;
	}
	return 0;
}

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

#define N_MAX 30
int n;
double dp[N_MAX] = {0.0};
int ans = 0;

int main(){
	
	dp[0] = 1;
	dp[1] = 1;
	dp[2] = 2;
	
	while(cin >> n){
		if(n == 0){
			break;
		}
		for(int i = 3; i <= n; i++){
			dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
		}
		
		ans = (int)dp[n] / 3650;
		ans++;
		cout << ans << 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) << endl;
     else
       cout << (dp[n]/3650)+1 << endl;
}
}

C++: #include<iostream>
 
using namespace std;
 
int dp[35];
 
int main(){
    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];
    }
     
    int n;
    while(cin>>n && n){
        cout<<dp[n]/3650+(dp[n]%3650!=0)<<endl;
    }
}