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 <iostream>
using namespace std;
long fib[45];
int main(){
	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] << '\n';
}

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

int f[45];

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

int main()
{
	int n;
	
	cin >> n;
	for(int i=0;i<=44;i++) f[i]=-1;
	cout << fib(n) << endl;
	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 main(){ 
  int N; cin >> N;

  vector<int> fib(50, 1);
  for(int i=0; i<N-1; i++) fib[i+2] = fib[i+1] + fib[i];

  cout << fib[N] << endl;
}

C++: a

C++: #include <bits/stdc++.h>
using namespace std;
int fib[50] = {1, 1};
int makeFib(int cur) {
    if(fib[cur]) {
        return fib[cur];
    }
    return fib[cur] = makeFib(cur - 1) + makeFib(cur - 2);
}
int main()
{
    for(int i = 2; i < 45; i++) {
        fib[i] = makeFib(i);
    }
    int n;
    cin >> n;
    cout << fib[n] << "\n";
}

C++: #include <iostream>

using namespace std;

int n;
int memo[45];

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

}

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

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

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

int memo[45] = {0};

int Fibonacci(int n) {
  if(n == 0 || n == 1) return memo[n] = 1;
  if(memo[n] != 0) { // memo[n]????¨??????????
	return memo[n];
  }
  return memo[n] = Fibonacci(n - 2) + Fibonacci(n - 1);
}

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

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

int Fibonatch(int result[], int num)
{
    int ret = result[num];

    if (ret != 0) {
        if (num > 1) {
            ret = Fibonatch(result, num - 1) + Fibonatch(result, num - 2);
        }
        else {
            ret = 1;
        }
        result[num] = ret;
    }

    return ret;
}

int main(void)
{
    int num;
    int ret[45] = {0};
    int result;

    scanf("%d", &num);
    result = Fibonatch(ret, num);

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

    return 0;
}

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

int fib(int n){
//  return (n == 0 || n == 1) ? 1 : fib(n - 1) + fib(n - 2);
  int memo[1000] = {1, 1};
  for(auto i = 2; i <= n; i++){
    memo[i] = memo[i - 1] + memo[i - 2];
  }
  return memo[n];
}

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

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

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

int main(){
  int n, fibn[1000];
  fibn[0] = fibn[1] = 1;
  cin >> n;
  for(int i = 2; i <= n;i++)
    fibn[i] = fibn[i-1] + fibn[i-2];
  cout << fibn[n] << endl;
  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 <iostream>

using namespace std;

int fib(int n) {
    int a = 1;
    int b = 1;

    int i = 0;
    while (i < n) {
        int tmp = a;
        a = b;
        b += tmp;
        ++i;
    }
    return a;
}

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

    cout << fib(n) << endl;

    return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define NIL -2000000001
#define MAX 2000

int A[MAX];
int n = 0;

int fib(int num) {
  if (A[num] != NIL) {
    return A[num];
  } else {
    A[num-2] = fib(num-2);
    A[num-1] = fib(num-1);
    return A[num-2]+A[num-1];
  }
}

int main() {
  int num;
  for ( int i = 0; i < MAX; i++ ) {
    A[i] = NIL;
  }
  A[0] = 1;
  A[1] = 1;
  scanf("%d", &num);
  printf("%d\n", fib(num));
  return 0;
}

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

using namespace std;

int fib(int n) {
    return n <= 1 ? 1 : fib(n - 1) + fib(n-2);
}

int dp[1000];

int fibMemoR(int n){
    if(n <= 1) return dp[n] = 1;
    if(dp[n])return dp[n];
    return dp[n] = fibMemoR(n-1) + fibMemoR(n-2);
}

int fibdp(int n){
    vector<int> dpv(n);
    dpv[0] = dpv[1] = 1;
    for (int i = 2; i < n; ++i)dpv[i] = dpv[i-1] + dpv[i-2];
    return dpv[n-1];
}

int fibloop(int n){
    int fib,fib2;
    fib = fib2 = 1;
    for (int i = 2; i < n; ++i){
        int tmp = fib;
        fib = fib + fib2;
        fib2 = tmp;
    }
    return fib;
}

int main(){
    //freopen("in", "r", stdin);
    int n;
    cin >> n;
    cout << fibloop(n+1) << endl;
    return 0;
}

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

int fib(int n, int a, int b);

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


int fib(int n, int a, int b){
	int f;
	f = a;
	if (n >= 1){
		f = fib(n - 1, a + b, a);
  }
	return (f);
}

C++: #include<bits/stdc++.h>
#define N 50
using namespace std;
int n;
vector<int> data(N);


void fibo(int n){
	data.at(0) = data.at(1) = 1;
	for(int i=2;i<=n;i++) data.at(i) = data.at(i-1) + data.at(i-2);
}

int main(){
	cin >> n;
	fibo(n);
	cout << data.at(n) << endl;
}

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

int main(){

    int fib[50];
    fib[0] = fib[1] = 1;
    for(int i = 2; i <= 45; i++){
        fib[i] = fib[i - 1] + fib[i - 2];
    }

    int n; cin >> n;
    cout << fib[n] << endl;
    return 0;
}

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

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

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

C++: #include<iostream>
using namespace std;
int n,fibonacci,f[44]={0};

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

int main(){
  cin >> n;
  fibonacci = makefibnacci(n);
  cout << fibonacci << endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int f[3]={1,1,1},n;
  cin >> n;
  while(1<n--){
    f[2]=f[0]+f[1];
    f[0]=f[1];    
    f[1]=f[2];
  }
  cout<<f[2]<<endl;
  return 0;
}

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

#define rep(i, n) for (int i=0; i<(n); ++i)
using ll = long long;
using P = pair<int, int>;

int dp[50];

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

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

  int ans = fib(n);
  cout << ans << endl;
  return 0;
}