Go: package main

import "fmt"

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

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

	fmt.Println(fib(n, f))
}

func fib(n int, f []int) int {
	if n == 0 {
		f[n] = 1
		return f[n]
	}
	if n == 1 {
		f[n] = 1
		return 1
	}

	if f[n] != 0 {
		return f[n]
	}

	f[n] = fib(n-2, f) + fib(n-1, f)
	return f[n]
}

C++: #include <iostream>

using namespace std;


int F[44];

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

  int input;
  cin >> input;
  cout << F[input]<< endl;
}

C++: #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <limits>
#include <fstream>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll dp[45];
  CLR(dp);
  dp[0]=dp[1]=1;
  FOR(i,2,45) dp[i]=dp[i-1]+dp[i-2];
  int n;
  cin>>n;
  cout<<dp[n]<<endl;
}

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

int main()
{
    int N;
    cin >> N;
    long long dp[N + 1];
    dp[0] = 1;
    dp[1] = 1;
    for (int i = 0; i < N - 1; i++) {
        dp[i + 2] = dp[i + 1] + dp[i];
    }
    printf("%lld\n", dp[N]);
}

C++: #include <iostream>

using namespace std;

int f(int n){
	static int dp[3000];
	for(int i=0;i<=n;i++){
	if(i==0|| i==1) dp[i] = 1;
	else dp[i] = dp[i-1] + dp[i-2];
	}
	return dp[n];
}
int main(){
	int n;
	cin>>n;
	cout<<f(n)<<endl;
}

C++: //c++ テンプレ
#include<bits/stdc++.h>
using namespace std;

typedef long long llint;
typedef long double ld;

#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(),v.end())
#define reverse(v) reverse(v.begin(),v.end())
#define rep(i,a,n) for(int i=a;i<n;i++)



priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }

vector<llint>f;

void solve(){
    int n;
    cin >> n;
    f.resize(n+1);
    f[0]=1;
    f[1]=1;
    rep(i,2,n+1)f[i]=f[i-1]+f[i-2];
    cout << f[n] << endl;
}

int main(){
    solve();
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vstring vector<string>
using namespace std;

#include<map>
#include<set>
#include<queue>

typedef long long ll;
typedef unsigned long long ull;

const int MAX_N = 1000000;

int dp[100];
int N;

int main() {
	cin >> N;
	rep(i, N+1){
		if(i == 0 || i == 1) dp[i] = 1;
		else dp[i] = dp[i-2] + dp[i-1];
	}
	cout << dp[N] << endl;
}

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

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

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

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

int main(){
	int n;
	vector<int> fib;

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

	return 0;
}

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

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

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 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 memo[55];
int fib(int n)
{
    if ( memo[n] == -1 ) {
        if ( n <= 1 ) memo[n] = 1;
        else memo[n] = fib(n - 1) + fib(n - 2);
    }
    return ( memo[n] );
}

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

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

C++: #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>

#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define vec(type,n) vector<type>(n)
#define vvec(m,n) vector<vector<int>> (int(m),vector<int>(n))
#define ALL(a)  (a).begin(),(a).end()

using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;

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

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

ll dp[1000000];

ll fib(ll n){
    if(dp[n] >= 0) return dp[n];

    if(n == 0) dp[n] = 0;
    else if(n == 1) dp[n] = 1;
    else dp[n] = fib(n-1) + fib(n-2);
    return dp[n];
}

int main(){
    ll n; cin >> n;
    memset(dp, -1, 1000000*sizeof(ll));

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

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

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

	// F[0] から F[n] までの分のメモリを確保
	vector<long long> dp(n + 1, 0);

	// 初期条件
	dp[0] = 1;
	dp[1] = 1;

	// DP の遷移を行う
	for (int i = 2; i <= n; ++i) {
		dp[i] += dp[i - 1];
		dp[i] += dp[i - 2];
	}

	// 答え
	cout << dp[n] << endl;
}

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

int main() {
    int n;
    cin>>n;
    int fib[100];
    fib[0] = 1;
    fib[1] = 1;

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

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

C++: #include <iostream>
#include<stdio.h>
using namespace std;
int main(void){
    int n,f[45];
    cin>>n;
    f[0]=1;
    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<vector>
using namespace std;

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

C++: #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

int main(){
  int n;
  int a[45];
  cin >> n;
  a[0] = 1;
  a[1] = 1;
  REP(i, 2, n+1){
    a[i] = a[i-1] + a[i-2];
  }

  cout << a[n] << endl;

}

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

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