Go: package main

import (
	"bufio"
	"fmt"
	"math/big"
	"os"
	"strconv"
)

func CountPatterns(i int, patternNums []int) int {
	if patternNums[i] != 0 {
		return patternNums[i]
	}
	if i == 0 {
		return 1
	}
	patternNums[i] += CountPatterns(i-1, patternNums)
	if i > 1 {
		patternNums[i] += CountPatterns(i-2, patternNums)
	}
	if i > 2 {
		patternNums[i] += CountPatterns(i-3, patternNums)
	}
	return patternNums[i]
}

func Solve(N int) int {
	patternNums := MakeFilledInts(N+1, 0)
	return (CountPatterns(N, patternNums) + 3649) / 3650
}

func main() {
	for N := scan.Int(); N != 0; N = scan.Int() {
		ans := Solve(N)
		fmt.Println(ans)
	}
}

// --------------------------------------------------------------------------------
// Input

var scan = NewScanner()

type Scanner struct{ *bufio.Scanner }

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(nil, 100000000)
	return &Scanner{sc}
}

func (s *Scanner) String() string {
	s.Scan()
	return s.Text()
}

func (s *Scanner) Strings(l int) []string {
	if l == 0 {
		return []string{}
	}
	sl := make([]string, l, l)
	for i := range sl {
		sl[i] = s.String()
	}
	return sl
}

func (s *Scanner) Int() int {
	n, _ := strconv.Atoi(s.String())
	return n
}

func (s *Scanner) Ints(l int) []int {
	if l == 0 {
		return []int{}
	}
	sl := make([]int, l, l)
	for i := range sl {
		sl[i] = s.Int()
	}
	return sl
}

func (s *Scanner) Int64() int64 {
	n, _ := strconv.ParseInt(s.String(), 10, 64)
	return n
}

func (s *Scanner) BigInt() *big.Int {
	return big.NewInt(s.Int64())
}

func (s *Scanner) BigInts(l int) []*big.Int {
	if l == 0 {
		return []*big.Int{}
	}
	sl := make([]*big.Int, l, l)
	for i := range sl {
		sl[i] = s.BigInt()
	}
	return sl
}

func (s *Scanner) Float64() float64 {
	f, _ := strconv.ParseFloat(s.String(), 64)
	return f
}

func (s *Scanner) Floats64(l int) []float64 {
	if l == 0 {
		return []float64{}
	}
	sl := make([]float64, l, l)
	for i := range sl {
		sl[i] = s.Float64()
	}
	return sl
}

// --------------------------------------------------------------------------------
// Output

const (
	Yes = "Yes"
	No  = "No"

	YES = "YES"
	NO  = "NO"
)

func PrintBool(v bool, trueStr, falseStr string) {
	if v {
		fmt.Println(trueStr)
	} else {
		fmt.Println(falseStr)
	}
}

// --------------------------------------------------------------------------------
// sort.BigIntSlice

type BigIntSlice []*big.Int

func (sl BigIntSlice) Len() int {
	return len(sl)
}

func (sl BigIntSlice) Less(i, j int) bool {
	return sl[i].Cmp(sl[j]) == -1
}

func (sl BigIntSlice) Swap(i, j int) {
	sl[i], sl[j] = sl[j], sl[i]
}

// --------------------------------------------------------------------------------
// Mint

const (
	Mod = 1000000007
)

type Mint int

func NewMint(value int) Mint {
	return Mint((value%Mod + Mod) % Mod)
}

func (x Mint) Add(y Mint) Mint {
	if v := x + y; v >= Mod {
		return v - Mod
	} else {
		return v
	}
}

func (x Mint) Sub(y Mint) Mint {
	if v := x + Mod - y; v >= Mod {
		return v - Mod
	} else {
		return v
	}
}

func (x Mint) Mul(y Mint) Mint {
	return (x * y) % Mod
}

func (x Mint) pow(n int) Mint {
	if n == 0 {
		return Mint(1)
	}
	a := x.pow(n >> 1)
	a = a.Mul(a)
	if n&1 != 0 {
		a = a.Mul(x)
	}
	return a
}

func (x Mint) Inverse() Mint {
	return x.pow(Mod - 2)
}

func (x Mint) Div(y Mint) Mint {
	return x * y.Inverse()
}

func (x Mint) Neg() Mint {
	return NewMint(int(-x))
}

// --------------------------------------------------------------------------------
// Factorial

type Factorial struct {
	fact        []Mint
	factInverse []Mint
}

func NewFactorial(n int) *Factorial {
	f := new(Factorial)
	f.init(n)
	return f
}

func (f *Factorial) init(n int) {
	fact := make([]Mint, n+1, n+1)
	fact[0] = NewMint(1)
	for i := 1; i <= n; i++ {
		fact[i] = fact[i-1].Mul(NewMint(i))
	}

	inv := make([]Mint, n+1, n+1)
	inv[n] = fact[n].Inverse()
	for i := n; i >= 1; i-- {
		inv[i-1] = inv[i].Mul(NewMint(i))
	}

	f.fact = fact
	f.factInverse = inv
}

func (f *Fa

Python: import math

# 1年での試行回数
Y = 365*10

# dpテーブル初期化
dp = [0]*(30+1)
dp[0] = 1
dp[1] = 1
dp[2] = 2

# dpテーブル作成
for i in range(3, 31):
    dp[i] = dp[i-1] + dp[i-2] + dp[i-3]

# 終了フラグ
flag = 0

# dpテーブル更新のindexの最大値を記録
i_max = 2

while flag == 0:
    floor = int(input())
    if floor == 0 :
        # 終了する
        flag = 1
    else:
        print(math.ceil(dp[floor]/Y))

Python: # Aizu Problem 00168: Kannondou
#
import sys, math, os, bisect

# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
    sys.stdin = open("sample-input.txt", "rt")


p = [1, 1, 2] + [0] * 28
for i in range(3, 31):
    p[i] = sum(p[i-3:])


while True:
    N = int(input())
    if N == 0:
        break
    y = int(p[N] / (10 * 365) + 1)
    print(y)

Python: import math


while True:
    n = int(input())
    if n == 0:
        break
    dp = [0] * (n + 1)
    dp[0] = 1
    for i in range(n):
        dp[i+1] += dp[i]
        if i > 0:
            dp[i+1] += dp[i-1]
        if i > 1:
            dp[i+1] += dp[i-2]
    print(math.ceil((dp[-1] / 10) / 365))

Python: while True:
    n = int(input())
    if n == 0:
        break
    
    dp = [-1] * n
    
    for i in range(n):
        if i == 0:
            dp[0] = 1
        elif i == 1:
            dp[1] = 2
        elif i == 2:
            dp[2] = 4
        else:
            dp[i] = dp[i-1] + dp[i-2] + dp[i-3]
    ans = dp[-1] // 3650
    if dp[-1] % 3650 > 0:
        ans += 1
    print(ans)

Python: dp = [0] * 34
dp[0] = 1
for i in range(30):
    dp[i+1] += dp[i]
    dp[i+2] += dp[i]
    dp[i+3] += dp[i]
while True:
    n = input()
    if n == 0: break
    print(dp[n]//3650+1)

Python: #coding:utf-8
from __future__ import division,print_function
try:
    input = raw_input
    range = xrange
except NameError:
    pass
# 上記のコードはPython2とPython3の違いを一部吸収するためのもの

# def solve(n):
# n : 段数(整数)
# 出力: 一郎君がすべての上り方を実行するのに必要な年数をprintする。
a=[0]*100
def solve(n):
    # ここに問題を解くプログラムをかく。s(4)==s(1)*4+s(2)*2+s(3)*1
    if n==1:
        a[1]=1
        return 1
    elif n==2:
        a[2]=2
        return 2
    elif n==3:
        a[3]=4
        return 4
    elif a[n]!=0:
        return a[n]
    else:
        a[n]=solve(n-3)+solve(n-2)+solve(n-1)
        return a[n]
    

def main():
    while True:
        inp=int(input())
        if inp==0:
            break
        print(solve(inp)//3650+1)

main()

Python: import sys
if sys.version_info[0]>=3: raw_input=input
a=[1,1,2]
for i in range(3,31): a.append(a[i-1]+a[i-2]+a[i-3])
while True:
	n=int(raw_input())
	if n==0: break
	print((a[n]+3649)//3650)

Python: def solve():
    ans = []
    while True:
        n = int(input())
        if n == 0:
            break

        dp = [0] * (n+1)
        dp[0] = 1
        for i in range(1, n+1):
            dp[i] += dp[i - 1]
            if i > 1:
                dp[i] += dp[i - 2]
            if i > 2:
                dp[i] += dp[i - 3]

        ans.append((dp[-1]+3649) // 3650)
    print(*ans, sep='\n')


if __name__ == "__main__":
    solve()

Python: def nob(n):
    nob_h=[n+1]

    for i in range(n+1):
        if i==0 or i==1:
            nob_h.append(1)
        elif i==2:
            nob_h.append(2)
        elif i>2:
            nob_h.append(nob_h[i]+nob_h[i-1]+nob_h[i-2])


    days=int(nob_h[n+1]/10)

    year=int(days/365)+1

    print(year)

n=[]

while True:
    i=input()
    if i == "0":
        break
    n.append(i)

for i in range(len(n)):
    nob(int(n[i]))

Python: def main():
    import sys

    readline = sys.stdin.readline

    while True:
        N = int(readline().rstrip())
        if N == 0:
            break

        dp = [0] * (N + 1)
        dp[0] = 1
        
        for i in range(1, N + 1):
            if i == 1:
                dp[i] += dp[i - 1]
            elif i == 2:
                dp[i] += dp[i - 1] + dp[i - 2]
            else:
                dp[i] += dp[i - 1] + dp[i - 2] + dp[i - 3]
        print(-(-dp[-1] // 3650))


main()