Go: package main

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

func max(x, y int) int {
	if x < y {
		return y
	} else {
		return x
	}
}

/*********************************************************************
長さmの列X_(m)と長さnの列Y_(n)の最長共通部分列LCSは、
	(1)X[m] == Y[n]ならば、X_(m-1)とY_(n-1)のLCSにX[m]を繋げたもの
	(2)X[m] != Y[n]ならば、X_(m-1)とY_(n)のLCSもしくはX_(m)とY_(n-1)のLCS
	のいずれかのうち長い方

c[m+1][n+1]：c[i][j]にX_(i)とY_(j)のLCSの長さを格納する二次元配列
*********************************************************************/

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	n, _ := strconv.Atoi(scanner.Text())
	for i := 0; i < n; i++ {
		scanner.Scan()
		s1 := scanner.Text()
		scanner.Scan()
		s2 := scanner.Text()
		s1, s2 = " " + s1 , " " + s2
		c := make([][]int, len(s1))
		for i := range c {
			c[i] = make([]int, len(s2))
		}

		LCS := 0

		for i := 1; i < len(s1); i++ {
			for j := 1; j < len(s2); j++ {
				if s1[i] == s2[j] {
					c[i][j] = c[i-1][j-1] + 1
				} else {
					c[i][j] = max(c[i-1][j], c[i][j-1])
				}
				LCS = max(LCS, c[i][j])
			}
		}
		fmt.Println(LCS)
	}
}

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

#define N 1000

int main(void) {
    int n;
    cin >> n;
    
    for(int k = 0; k < n; ++k) {
        string s1, s2; 
        int max = -1;
        int ans[N + 1][N + 1];
        
        cin >> s1 >> s2;
        
        for(int i = 0; i < s1.length(); ++i) {
            ans[i][0] = 0;
        }
        for(int j = 0; j < s2.length(); ++j) {
            ans[0][j] = 0;
        }
        
        for(int i = 0; i < s1.length(); ++i) {
            for(int j = 0; j < s2.length(); ++j) {
                if(s1[i] == s2[j]) {
                    ans[i + 1][j + 1] = ans[i][j] + 1;
                } else {
                    ans[i + 1][j + 1] = (ans[i][j + 1] > ans[i + 1][j]) ? ans[i][j + 1] : ans[i + 1][j];
                }
                max = (max > ans[i + 1][j + 1]) ? max : ans[i + 1][j + 1];
            }
        }
        
        cout << max << endl;
    }
}

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

int dp[1001][1001];

int main(){
  int q,xl,yl;
  char X[1001],Y[1001];

  cin >> q;

  for (int i=0;i<q;i++){
    cin >> X >> Y;

    xl=strlen(X);
    yl=strlen(Y);
  
    for (int i=1;i<=xl;i++)dp[0][i]=0;
    for (int i=1;i<=yl;i++)dp[i][0]=0;
    for (int i=0;i<yl;i++)
      for (int j=0;j<xl;j++){
	if (X[j]==Y[i]){
	  dp[i+1][j+1]=dp[i][j]+1;
	}else{
	  if (dp[i+1][j]>dp[i][j+1])
	    dp[i+1][j+1]=dp[i+1][j];
	  else
	    dp[i+1][j+1]=dp[i][j+1];	    
	}
      }
    cout << dp[yl][xl]<<endl;
    
  }
  
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#define INF 100000

using namespace std;

int dp[1000][1000];
string X, Y;

int lcs(int i,int j){
  if(i < 0 || j < 0) return 0;
  if(dp[i][j] != INF) return dp[i][j];

  if(X[i] == Y[j]){
    dp[i][j] = lcs(i-1, j-1) + 1;
    return dp[i][j];
  } else {
    dp[i][j] =  max(lcs(i-1,j), lcs(i, j-1));
    return dp[i][j];
  }
}

void clear(){
  for(int i = 0;i < X.size();i++){
    for(int j = 0;j < Y.size();j++){
      dp[i][j] = INF;
    }
  }
}

int main(){
  int q;

  cin >> q;

  for(int i = 0;i < q;i++){
    cin >> X >> Y;
    
    clear();
    
    cout << lcs(X.size()-1, Y.size()-1) << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll mod2 = 998244353;
const int INF = 1000000005;
const int MAX = 1005;

int lcs[MAX][MAX];

int main() {
  int q, nx, ny;
  string x, y;
  cin >> q;

  rep(i, q) {
    cin >> x >> y;
    nx = x.size();
    ny = y.size();

    rep(i, nx+1) {
      rep(j, ny+1) {
        lcs[i][j] = 0;
      }
    }

    FOR(i, 1, nx+1) {
      FOR(j, 1, ny+1) {
        if (x[i-1] == y[j-1]) {
          lcs[i][j] = lcs[i-1][j-1] + 1;
        }
        else {
          lcs[i][j] = max(lcs[i-1][j], lcs[i][j-1]);
        }
      }
    }

    cout << lcs[nx][ny] << endl;
  }

  
  return 0;
}

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

using namespace std;

using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG

/**
 * For DEBUG
 * https://github.com/ta7uw/cpp-pyprint
 */
#include "cpp-pyprint/pyprint.h"

#endif

void Main() {
    int Q;
    cin >> Q;
    while (Q--) {
        string X, Y;
        cin >> X >> Y;
        ll N = X.size();
        ll M = Y.size();
        vector<vector<ll>> dp(N + 1, vector<ll>(M + 1, 0));
        rep(i, N) {
            rep(j, M) {
                if (X[i] == Y[j]) {
                    dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + 1);
                }
                dp[i + 1][j + 1] = max({dp[i + 1][j + 1], dp[i][j + 1], dp[i + 1][j]});
            }
        }
        cout << dp[N][M] << '\n';
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    Main();
    return 0;
}

C++: 
?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
char len1[1001], len2[1001];
 
LCS(int x, int y){
  int i,j,c[1001][1001];
 
   for(i=0;i<=x;i++){
      c[i][0]=0;
  }
 
  for(j=0;j<=y;j++){
    c[0][j]=0;
  }
 
  for(i=1;i<=x;i++){
    for(j=1;j<=y;j++){
      if(len1[i-1]==len2[j-1]){
    c[i][j]=c[i-1][j-1]+1;
      }else if(c[i-1][j-1]>=c[i][j-1]){
    c[i][j] = c[i-1][j];
      }else{
    c[i][j] = c[i][j-1];
      }
    }
  }
 
  if(i==0 || j==0){
    return 0;
  }else if(i>0 && j>0 && x == y){
    return c[i-1][j-1];
  }else if(i>0 && j>0 && x!=y){
    return c[x][y];
  }
}
 
main(){
  int n,i,l1,l2,result;
 
  scanf("%d", &n);
   
  for(i=0;i<n;i++){
    scanf("%s",len1);
    scanf("%s",len2);
    l1=strlen(len1);
    l2=strlen(len2);
    
    result=LCS(l1,l2);
    printf("%d\n",result);
  }
  return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
static const int N = 1000;

int lcs(string x, string y);

int main() {
    int n;
    cin >> n;
    string x, y;
    for (int i = 0; i < n; i++) {
        cin >> x >> y;
        cout << lcs(x, y) << endl;
    }
    return 0;
}
int lcs(string x, string y) {
    int c[N + 1][N + 1];
    int m = (int)x.size(), n = (int)y.size();
    for (int i = 0; i <= m; i++) c[i][0] = 0;
    for (int j = 1; j <= n; j++) c[0][j] = 0; //c[0][0] is prepared above
    int maxl = 0;
    x = ' ' + x;
    y = ' ' + y;
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) {
            if (x[i] == y[j]) c[i][j] = c[i-1][j-1] + 1;
            else c[i][j] = max(c[i-1][j], c[i][j-1]);
            maxl = max(maxl, c[i][j]);
        }
    }
    /*for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) {
            cout << c[i][j] << " ";
        }
        cout << endl;
    }*/
    return maxl;
}