Go: package main

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

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}
	fmt.Println(fibonacci(n, make(map[int]int)))
}

func fibonacci(x int, memo map[int]int) int {
	if x == 0 || x == 1 {
		return 1
	}
	if y, ok := memo[x]; ok {
		return y
	}
	z := fibonacci(x-1, memo) + fibonacci(x-2, memo)
	memo[x] = z
	return z
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

C++: #include"bits/stdc++.h"
using namespace std;

vector<int> F;

int fibonacci(int N)
{
	F.push_back(1);
	F.push_back(1);
	for (int i = 2; i <= N; i++)
	{
		F.push_back(F[i - 2] + F[i - 1]);
	}
	return F[N];
}

int main(void)
{
	int N, ans;
	cin >> N;

	ans = fibonacci(N);

	cout << ans << endl;

	return 0;
}

C++: #include <bits/stdc++.h>

#define MAX 50

using namespace std;

int m_fibo(int n){
    static int ans[MAX];
    if(n == 0 || n == 1) ans[n] = 1;
    if(ans[n] > 0) return ans[n];
    return ans[n] = m_fibo(n-1)+m_fibo(n-2);
}

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

C++: #include <cstdio>

int fibonacci(int* fib, int n){
    if(n<=1)return 1;
    if(fib[n]>0)return fib[n];
    fib[n] = fibonacci(fib, n-1) + fibonacci(fib, n-2);
    return fib[n];
}

int main(){
    int i, n, fib[45];
    for(i=0;i<45;i++){
        fib[i]=-1;
    }
    scanf("%d",&n);
    printf("%d\n",fibonacci(fib, n));
    return 0;
}

C++: #include<iostream>
using namespace std;
int memo[50];
int fib(int n){
  if(memo[n] >= 0)return memo[n];
  if(n <= 1)return 1;
  return memo[n] = fib(n-1) + fib(n-2);
}

int main(){
  int n;
  cin >> n;
  fill(memo,memo+50,-1);
  cout << fib(n) << endl;
}

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

int main(){
	int n; cin >> n;
	int F[50];
	F[0] = F[1] = 1;
	for (int i=2; i<=n; i++){
		F[i] = F[i-1] + F[i-2];
	}

	cout << F[n] << endl;

	return 0;
}

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 fib(int n){
	int dp[1000];
	fill_n(dp, 1000, 0);
	dp[0] = 1;
	dp[1] = 1;
	for(int i = 2; i < n; i++){
		dp[i] = dp[i-1] + dp[i-2];
	}
	return dp[n-1];
}

int main(void){
	int n;
	cin >> n;
	FIN(fib(n+1));
	return 0;
}

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

int main() {
  int x, y;
  int F[50];
  F[0] = F[1] = 1;
  for ( int i = 2; i < 50; i++ ) F[i] = F[i-1] + F[i-2];

  cin >> x;
  cout << F[x] << endl;

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;



#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;

using Graph = vector<vector<char>>;

int main() {
  ll n;
  cin >> n;
  ll dp[50];
  dp[0]=1;
  dp[1]=1;
  for(int i=2; i<=n; i++){
    dp[i]=dp[i-1]+dp[i-2];
  }
  cout << dp[n] << endl;
}

C++: #include <cstdint>

using namespace std;

#define MEMO_SIZE 44
int64_t memo[MEMO_SIZE];

void fib_init()
{
  for (uint32_t i = 0; i < MEMO_SIZE; i++) {
    memo[i] = -1;
  }
}

uint32_t fib(uint32_t i)
{
  if (i == 0) {
    return memo[0] = 1;
  } else if (i == 1) {
    return memo[1] = 1;
  } else {
    int64_t val1 = memo[i - 1], val2 = memo[i - 2];
    if (val1 == -1) {
      val1 = memo[i - 1] = fib(i - 1);
    }

    if (val2 == -1) {
      val2 = memo[i - 2] = fib(i - 2);
    }

    return val1 + val2;
  }
}

#include <iostream>

int32_t main()
{
  fib_init();
  uint32_t i;
  cin >> i;
  cout << fib(i) << endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(void){
	int n;
	cin>>n;
	int fib[n];
	fib[0]=fib[1]=1;
	for(int i=2;i<=n;i++)fib[i]=fib[i-1]+fib[i-2];
	cout<<fib[n]<<endl;;
	return 0;
}

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

int n;
int F[45];
int fibo(int i) {
    if (F[i]) {
        return F[i];
    }
    return fibo(i - 1) + fibo(i-2);
}

int main() {
    cin >> n;
    F[0] = F[1] = 1;
    cout << fibo(n);

    return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>

using namespace std;

int main()
{
    int fib[45] = {};
    fib[0] = fib[1] = 1;

    int n;
    cin >> n;
    if (n < 2) {
        cout << fib[n];
    } else {
        for (int i = 2; i <= n; i++) {
            fib[i] = fib[i - 1] + fib[i - 2];
        }
        cout << fib[n] << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

C++: #include<stdio.h>
#define MAX 44

int main(){
  int n, i; 
  int F[50];

  scanf("%d", &n);
  if(n>MAX){
    printf("Number must be smaller than 44!\n");
    return -1;
  }
  
  F[0] = F[1] = 1;
  for ( i = 2; i <= n; i++ ){
    F[i] = F[i-1] + F[i-2];
  }

  printf("%d\n", F[n]);

  return 0;
}

C++: #include<iostream>

using namespace std;

int main() {
  int N;
  cin >> N;

  int F[50];

  F[0] = F[1] = 1;
  for (int i = 2; i <= N; i++) {
    F[i] = F[i - 1] + F[i - 2];
  }

  cout << F[N] << endl;

  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int f[50];

int fibo(int n)
{
  if(n <= 1) return 1;
  else{
    if(f[n]){
      return f[n];
    }
    else{
      return f[n] = fibo(n-1)+fibo(n-2);
    }
  }
}

int main()
{
  int n;
  cin >> n;

  cout << fibo(n) << endl;
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<cstdio>
int fib(int);
using namespace std;
int main()
{
	int n,ans;
	cin >> n;
	ans = fib(n - 1);
	cout << ans << endl;
}
int fib(int n)
{
	if (n < 1)
		return 1;
	else
	{
		return fib(n - 1)+fib(n - 2);
	}
}

C++: // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;

int main(){
    int N;
    cin >> N;
    vector<int> A(50);
    A[0] = A[1] = 1;
    for(int i = 2; i <= N; i++){
        A[i] = A[i - 1] + A[i - 2];
    }
    cout << A[N] << endl;
}

C++: #include <iostream>

using namespace std;

int main() {
    int n;
    cin >> n;

    int a = 1, b = 1;
    if (n < 2) {
        cout << 1 << endl;
    } else {
        int ans;
        for (int i = 2; i <= n; ++i) {
            ans = a + b;
            b = a;
            a = ans;
        }

        cout << ans << endl;
    }

    return 0;
}