Go: package main

import (
	"fmt"
)

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

	fibo := make([]int, n+1)
	fibo[0] = 1
	fibo[1] = 1

	for i := 2; i <= n; i++ {
		fibo[i] = fibo[i-1] + fibo[i-2]
	}

	fmt.Println(fibo[n])
}

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

using namespace std;

int n,dp[50];

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

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

C++: #include <iostream>
#include <algorithm>
#include <vector>
#define debug(x) cout << #x << "==" << x << endl;

using namespace std;

//??\???
#define MAX_N 44
int N;
int dp[MAX_N];

int main() {
  ios::sync_with_stdio(false);

  cin >> N;

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

  int now = 0;
  int prev1 = 1, prev2 = 1;
  for(int i = 2; i <= N; i++) {
    now = prev1 + prev2;
    prev2 = prev1;
    prev1 = now;
  }

  cout << now << endl;

  return 0;
}

C++: #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
 
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
 
using namespace std;
 
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
 
const int INF=1<<29;
const double EPS=1e-9;
 
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

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

int main(int argc, char const *argv[]) {
	int n;
	cin >> n;
	int ans = fib(n);
	cout << ans << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n+1); ++i)
using namespace std;
using ll = long long;
// const int INF = +100100100;
// typedef pair<int,int> P;



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

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

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

C++: #include<iostream>

using namespace std;

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

	cin >> n;

	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; n++){
        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,fib[45];
	fib[0]=fib[1]=0;
	scanf("%d",&n);
	for(int i=2;i<=n;i++)
		fib[i]=fib[i-1]+fib[i-2];
	printf("%d\n",fib[n]);
	return 0; 
}

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

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

  int n;
  scanf("%d",&n);

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

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

int fib[45];

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

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

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

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

int main() {
	int n;
	int i;
	vector<long long> fib;
	scanf("%d",&n);
	fib.resize(n+1);
	fib[0]=fib[1]=1;
	for(i=2; i<=n; ++i) {
		fib[i]=fib[i-1]+fib[i-2];
	}
	printf("%lld\n",fib[n]);
	return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	int n;
	cin >> n;
	int f[50] = {1, 1};
	for (int i = 2; i < n; ++i)
	{
		f[i] = f[i - 1] + f[i - 2];
	}
	cout << f[n-1] << 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 <cstdlib>
#include <string>
#include <typeinfo>
#include <cstring>
#include <iostream>
#include <algorithm>
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;

typedef unsigned long long ull;
int dp[45] = {0};

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

int main(void) {
  int n;
  cin >> n;
  //cout << fib(n) << endl;
  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;
  return 0;
}

C++: #include<iostream>

using namespace std;
int fib(int n);
int main() {
  int n;

  //入力
  cin >> n;

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

  return 0;
}

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

C++: #include <iostream>
#include <map>
using namespace std;
int memofib(int n) {
    static map<int,int> cache;
    map<int,int>::iterator it = cache.find(n);
    if( it != cache.cend() )
        return it->second;   
    int t;
    if(n==1) 
        return 1;
    else if(n==2)
        return 2;
    else
        return memofib(n-1) + memofib(n-2);
    cache.insert(std::make_pair(n, t));
    return t;
}
int main(void){
    int n;
    cin >> n ;
    cout << memofib(n) << endl;
    return 0;
}

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

C++: #include<stdio.h>

int main(){
  int i,input,fibonacciA=1,fibonacciB=1,fibonacciC=1;
  scanf("%d",&input);
  if(input == 0 || input == 1){
    printf("%d\n",fibonacciA);
  }else{
    for(i=1;i<input;i++){
      fibonacciC = fibonacciB + fibonacciA;
      fibonacciA = fibonacciB;
      fibonacciB = fibonacciC;
    }
    printf("%d\n",fibonacciC);
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
const double phi = (1 + sqrt(5)) / 2;
const double phi_ = (1 - sqrt(5)) / 2;
double fib(ll n){
    double res = pow(phi, n+1) - pow(phi_, n+1);
    return res / sqrt(5);
}
int main(){
    ll n, ans; cin >> n;
    ans = fib(n);
    cout << ans << 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 <cstdio>
#include <iostream>

using namespace std;

int F[50];

int fib(int n) {

	if (n == 0 || n == 1)
		return 1;
	if (F[n] != 0)
		return F[n];

	F[n] = fib(n - 1) + fib(n - 2);

	return F[n];
}

int main() {

	int n;
	scanf("%d", &n);

	for (int i = 0; i < n; ++i) {
		F[i] = 0;
	}

	cout << fib(n) << endl;

	return 0;

}