Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func main() {
	sc1 := bufio.NewScanner(os.Stdin)
	sc1.Split(bufio.ScanWords)
	sc1.Scan()
	num, _ := strconv.Atoi(sc1.Text())
	cache := make([]*int, num+1)
	fmt.Println(fib(num, cache))

}

func fib(n int, cache []*int) int {
	if n <= 1 {
		return 1
	}

 	if cache[n] != nil {
		return *(cache[n])
	}

	result := fib(n -2, cache) + fib(n -1, cache)
	cache[n] = &result
	return result
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <functional>
#include <fstream>
#include <cstdlib>
typedef long long ll;
const int MOD = 1e9+7;


#define REP(i, N) for (int i = 0; i < (N); i++)
#define REPP(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define VSORT(c) sort((c).begin(),(c).end())
#define SZ(x) ((int)(x).size())
//vvintを作る　マクロで　 #define vvint(N,M) vector<vector<int>>

using namespace std;
vector<int> fibo(44,-1);

int fibonacci1(int n){
    if(n == 1 || n == 0){
        return fibo[n] = 1;
    }
    if(fibo[n] != -1){
        return fibo[n];    
    }
    return fibo[n] = fibonacci1(n-1) + fibonacci1(n-2);
}

int fibonacci2(int n){
    fibo[0] = 1;
    fibo[1] = 1;
    for(int i = 2; i < n+1;i++){
        fibo[i] = fibo[i-1] + fibo[i-2];
    }
    return fibo[n];
}


int main(){
    
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    // cout << fibonacci1(n) << endl;
    cout << fibonacci2(n) << endl;
    
    

    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <cmath>
#include <ios>
#include <ctype.h>
#include <stack>
#include <istream>
#include <stdio.h>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>
#include <functional>
#include <bitset>
#include <list>
#include <deque>
#include <time.h>
#include <random>
#include <iomanip>
#include <fstream>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,a,b) for (int i = a; i < (b); ++i)
#define RREP(i,a,b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(),(x).end()
#define YY cout << "Yes" << endl
#define NN cout << "No" << endl
const long long INF = 1000000007;
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
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; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
vector<int>dp(1000,-1);
int f(int n){
  if(dp[n]!=-1)return dp[n];
  return dp[n]=f(n-1)+f(n-2);
}
int solve(){
  int n;
  cin>>n;
  dp[0]=1;
  dp[1]=1;
  cout<<f(n)<<endl;
  return 0;
}
int main(){
  // ios::sync_with_stdio(false);cin.tie(nullptr);
  // cout << fixed;cout << setprecision(16);
  solve();
  return 0;
}

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

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, i;
  cin >> n;
  int f[n];
  f[0] = 1, f[1] = 1;
  for (i = 2; i <= n; ++i) {
    f[i] = f[i - 1] + f[i - 2];
  }

  cout << f[n] << '\n';

  return 0;
}

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

int main(void) {
    cin >> num;
    int array[num] = {};
    array[0] = 1;
    array[1] = 1;
    for (int i= 2; i <= num; i++) {
        array[i] = array[i - 1] + array[i - 2];
    }
    cout << array[num] << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int DP[45];
void init(){
    rep(i,45)DP[i]=-1;
}

int fibonaci(int n){
    if(DP[n]!=-1)return DP[n];
    if(n==0||n==1)return DP[n]=1;
    return DP[n]=fibonaci(n-1)+fibonaci(n-2);
}

int main(){
    init();
    int n;cin>>n;
    cout<<fibonaci(n)<<endl;
}

C++: #include<iostream>

using namespace std;
int fib(int n);
int memo[45];
int main() {
  int n;

  //入力
  cin >> n;

  //出力
  cout << fib(n) << endl;

  return 0;
}

int fib(int n){
  if(n==0 || n == 1){
    return 1;
  }else if(memo[n] != 0){
    return memo[n];
  }
  }else{
    return memo[n] = fib(n-1) + fib(n-2);
  }
}

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

int result[45];

int fib(int n){
    if(n == 0 || n == 1)return result[n] = 1;
    if(result[n] != -1) return result[n];
    return result[n] = fib(n - 1) + fib(n - 2);
}

int main(){
    int n;
    for(int i = 0;i < 45;++i){
        result[i] = -1;
    }
    cin >> n;
    cout << fib(n) << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;


ll dp[50];

int main(){
    int n; cin >> n;
    dp[0] = 1;
    dp[1] = 1;
    rep(i, n){
        dp[i + 2] = dp[i + 1] + dp[i];
    }
    cout << dp[n] << endl;
    return 0;
}

C++: #include <stdio.h>

//int f[44];

int fib(int n)
{
  if (n < 2) return 1;
  //if (f[n] == 0) f[n] = 
  return fib(n - 1) + fib(n - 2);
  //return f[n];
}

int main()
{
  int n;

  scanf("%d", &n);

  printf("%d\n", fib(n));

  return (0);
}

C++: #include <iostream>
#include <stdlib.h>
 
using namespace std;
 
#define MAX_N 44

class Fib{
private:
  int size;
  int *A;
public:
  Fib(int size){
    this->size = size;
    makeFib();
  }

  int getFib(int n){
    return A[n];
  }

  void makeFib(){
    int i;
    this->A = (int*)malloc(sizeof(int)*this->size);
    this->A[0] = 1;
    this->A[1] = 1;
    for(i = 2;i < this->size;i++){
      this->A[i] = this->A[i-2]+this->A[i-1];
    }
  }

  ~Fib(){
    free(A);
  }
};
 
int main(){
 
    int n;
    Fib *fib = new Fib(MAX_N); 

    cin >> n;
 
    cout << fib->getFib(n) << endl;
 
    delete fib;

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
    int n;
    cin >> n;
    vector<int> fib(n + 1, 1);
    repd(i, 2, n + 1) {
        fib[i] = fib[i - 1] + fib[i - 2];
    } 

    cout << fib[n] << endl;
    return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
using ll = long long;

class Fib {
	vector<ll> memo;
public:
	Fib(ll initial_size = 16) : memo(initial_size,-1) {};// -1 is sentinel
	ll operator() (ll n) {
		if (n > memo.size() - 1) {
			memo.resize(2*n,-1);
		}
		if (n == 0 || n == 1) {
			return 1;
		}
		if (memo[n] != -1) {
			return memo[n];
		}
		memo[n] = operator()(n-1) + operator()(n-2); 
		return memo[n];
	}
};

int main () {
	int n;
	cin >> n;
	Fib fib;
	cout << fib(n) << endl;
	return 0;
}

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

int fibmemo[45] = {0};
int fibMemo(int n);

int fib(int n){
    if(n == 0 || n == 1)   return 1;
    else
        return fibMemo(n - 1) + fibMemo(n - 2);    
}

int fibMemo(int n){
    if(fibmemo[n] == 0){
        fibmemo[n] = fib(n);
    }
    return fibmemo[n];
}


int main(void){
    int n;
    cin >> n;
    cout << fib(n) << endl;
}