Go: package main

import (
	"fmt"
)

const MAX = 45

var dp [MAX]int

func fin(n int) int {
	if dp[n] != 0 {
		return dp[n]
	}

	switch n {
	case 0:
		dp[n] = 1
	case 1:
		dp[n] = 1
	default:
		dp[n] = fin(n-1) + fin(n-2)
	}
	return dp[n]
}

func main() {
	var n int
	fmt.Scan(&n)
	fmt.Println(fin(n))
}

Python: import math
n = int(input())
print(round((pow((1+math.sqrt(5))/2,n) - pow((1-math.sqrt(5))/2,n)) / math.sqrt(5)))

Python: class Fibonacci(object):
    memo = [1, 1]
    def __init__(self):
        pass

    def get_nth(self, n):
        if n <= len(Fibonacci.memo):
            return Fibonacci.memo[n]
        for i in range(len(Fibonacci.memo), n+1):
            result = Fibonacci.memo[i-1] + Fibonacci.memo[i-2]
            Fibonacci.memo.append(result)
        return Fibonacci.memo[n]


if __name__ == '__main__':
    # ??????????????\???
    num = int(input())

    # ?????£??????????????°????¨????
    f = Fibonacci()
    result = f.get_nth(num)

    # ???????????????
    print('{0}'.format(result))

Python: def fib(n):
    l = [0]*(n+1)
    l[0] = 1
    l[1] = 1
    for i in range(2, n+1):
        l[i] = l[i-1] + l[i-2]
    return l[n]

n = int(input())
print(fib(n))

Python: n = int(input())

l = [1,1]

if n in [0,1]:
    print(1)
else:
    for i in range(2, n+1):
        fib = l[-1] + l[-2]
        l.append(fib)
    print(fib)

Python: import numpy as np
import sys
f = [-1 for i in range(45)]
f[0] = f[1] = 1

def fib(n):
    global f
    for i in range(2,n+1):
        f[i] = f[i - 1] + f[i - 2]
        #print(i,f[i])
    return f[n]

if __name__ == "__main__":
    n = input("input number: ")
    n = int(n)
    #print(type(n))
    print(fib(n))

Python: def fib(n):
    l = [0] * (n + 1)
    l[0] = 1
    l[1] = 1

    for i in range(2, n + 1):
        l[i] = l[i - 2] + l[i - 1]
    
    return l[n]

def main():
    n = int(input())
    print(fib(n))

main()

Python: N = int(input())
a = b = 1
while N:
    a, b = b, a+b
    N -= 1
print(a)

Python: n = int(input()) - 1
fib = [1, 1] + [0] * n
for i in range(2, n):
    fib[i] = fib[i-1] + fib[i-2]
print(fib[n])

Python: n = int(input())

# dpテーブルの用意
dp = [-1]*(n+1)

# dpの初期値
dp[0], dp[1] = 1, 1

for i in range(2,n+1):
    dp[i] = dp[i-1] + dp[i-2]

print(dp[-1])

Python: def dynamic(n):
    if n == 0 or n == 1:
        return 1
    if F[n] != 0:
        return F[n]
    F[n] = dynamic(n - 1) + dynamic(n - 2)
    return F[n]

if __name__ == '__main__':
    n = int(raw_input())
    print(dynamic(n))

Python: import sys
input = sys.stdin.readline


def inpl():
    return list(map(int, input().split()))


def f(n):
    if n < 2:
        return 1
    ret = [0] * (n + 1)
    ret[0] = 1
    ret[1] = 1
    for i in range(2, n + 1):
        ret[i] = ret[i - 2] + ret[i - 1]
    return ret[n]


print(f(int(input())))

Python: # -*- coding: utf-8 -*-


def fib(n):
    if n == 0 or n == 1:
        return 1
    return fib(n-1) + fib(n-2)

def fib_memo(n, memo):
    if n == 0 or n == 1:
        memo[n] = 1
        return memo[n]
    if memo[n] != -1:
        return memo[n]
    memo[n] = fib_memo(n-1, memo) + fib_memo(n-2, memo)
    return memo[n]

memo = [-1 for i in range(45)]

n = int(input())
print(fib_memo(n, memo))

Python: n = int(input())
memo = [1]*(n+1)
for i in range(2, n+1):
    memo[i] = memo[i-1]+memo[i-2]
print(memo[n])

Python: fib = [1 for i in range(45)]
for i in range(2, 45):
    fib[i] = fib[i - 1] + fib[i - 2]
i = int(input())
print(fib[i])

Python: n = int(input())
fn0 = 1
fn1 = 1
if n == 0:
    fn = fn0
elif n == 1:
    fn = fn1
else:
    for ni in range(2, n+1):
        fn = fn0 + fn1
        fn0 = fn1
        fn1 = fn
print(fn)

Python: from functools import lru_cache


@lru_cache(maxsize=None)
def fibo(n):
    if n == 0 or n == 1:
        return 1

    return fibo(n - 1) + fibo(n - 2)


n = int(input())

print(fibo(n))

Python: def fibonacci(n, l):
  if n <= 1:
    l[n] = 1
    return l[n]
  elif l[n] != 0:
    return l[n]
  else:
    l[n] = fibonacci(n-1, l) + fibonacci(n-2, l)
    return l[n]


n = int(input())
l = [0] * (n+1)
print(fibonacci(n, l))

Python: def Fibonacci(n):
	if n==0 or n==1 : return 1
	return Fibonacci(n-1)+Fibonacci(n-2)

print( Fibonacci( int(input()) ) )

Python: n = int(input())

DP = [0 for _ in range(n+1)]
DP[0] = 1
DP[1] = 1

for i in range(2, n+1):
    DP[i] = DP[i-1]+DP[i-2]
print(DP[n])

Python: def fib(n):
  if n < 0:
    print("error")
    exit()
  if n < 2:
    result = 1
  result = fib(n-1) + fib(n-2)
  return result

n = int(input())
fib(n)

Python: n = int(input())

for i in range(n+1):
    if i == 0 or i == 1:
        a = b = c = 1
    else:
        c = a + b
        a, b = b, c
print(c)

Python: n = int(input())

a0 = 1
a1 = 1

aList = [a0, a1]

if n == 0:
    print(a0)
    exit()
elif n == 1:
    print(a1)
    exit()
else:
    for i in range(2, n+1):
        aList.append(aList[i-1] + aList[i-2])

    print(aList[n])

Python: def fib(numbers, find):
    if len(numbers) <= find:
        numbers.append(numbers[-1] + numbers[-2])
        fib(numbers, find)
    else:
        print(numbers)
        print(numbers[find-1])


# n = 4
n = int(input())
number_list = []


if n == 0 or n == 1:
    print(1)
else:
    number_list.append(n-2)
    number_list.append(n-1)
    fib(number_list, n)

Python: dp = [0]*100
dp[0] = 1
dp[1] = 1

def fib(n):
    if dp[n]!=0:
        return dp[n]
    else:
        dp[n] = fib(n-1) + fib(n-2)
    return dp[n]
    
print(fib(int(input())))

Python: import sys
n = int(input())
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1
if n == 0:
    print(1)
    sys.exit()
elif n == 1:
    print(1)
    sys.exit()

for i in range(2, n+1):
    dp[i] = dp[i-1] + dp[i-2]

print(dp[n])

Python: fib = [0] * 45

fib[0] = fib[1] = 1

for i in range(2, 45):
    fib[i] = fib[i - 1] + fib[i - 2]

print(fib[int(input())])

Python: n = int(input())

dp = [1]*45

for i in range(2, n+1):
    dp[i] = dp[i-1] + dp[i-2]

print(dp[n])

Python: 
f = [-1 for i in range(45)]
f[0] = f[1] = 1

def fib(n):
    global f
    for i in range(2,n+1):
        f[i] = f[i - 1] + f[i - 2]
        #print(i,f[i])
    return f[n]

if __name__ == "__main__":
    n = input()
    n = int(n)
    #print(type(n))
    print(fib(n))

Python: n = int(input())

def fb(num):
    a, b = 1, 0
    for i in range(num):
        a, b = a + b, a
    return b

print(fb(n+1))

Python: n = int(input())

fib = []
for i in range(n+1):
    if i <=1 :
        fib.append(1)
    if i > 1 :
        fib.append( fib[i-2] + fib[i-1] )

print(fib[n])

Python: n = int(input())

MAX = 45
table = [0] * MAX
for i in range(MAX):
    # print(n)
    if i == 0 or i == 1:
        table[i] = 1
    else:
        table[i] = table[i - 1] + table[i - 2]

print(table[n])

Python: # -*- coding:utf-8 -*-


def memoize(proc):
    cache = {}

    def helper(*args, **kargs):
        if args not in cache:
            cache[args] = proc(*args, **kargs)
        return cache[args]

    return helper


@memoize
def fib(n):
    if n < 2:
        return 1
    else:
        return fib(n - 1) + fib(n - 2)


if __name__ == "__main__":
    print(fib(int(input())))

Python: N = int(input())
dp = [0] * (N + 1)
if N == 0:
    print(0)
    exit()
if N == 1:
    print(1)
    exit()
dp[0] = 1
dp[1] = 1
for i in range(2, N + 1):
    dp[i] = dp[i - 1] + dp[i - 2]

print(dp[-1])

Python: # 34

n = int(input())

dp = [None] * (n+1)
dp[0] = 1
dp[1] = 1

for i in range(n-1):
    dp[i+2] = dp[i] + dp[i+1]

print(dp[n])

Python: import sys
import itertools
# import numpy as np
import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(input())

dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 1

def fib(n):
    if dp[n] > 0:
        return dp[n]
    
    dp[n] = fib(n - 1) + fib(n - 2)
    return dp[n]

print(fib(N))