Go: package main

import "fmt"

func main() {
	var nPairs int
	fmt.Scanln(&nPairs)

	var a, b string
	for i := 0; i < nPairs; i++ {
		fmt.Scanln(&a)
		fmt.Scanln(&b)
		fmt.Println(lcsSize(a, b))
	}
}

func lcsSize(sa, sb string) int {
	dp := make([][]int, len(sa)+1)
	for i := 0; i <= len(sa); i++ {
		dp[i] = make([]int, len(sb)+1)
	}

	for a := 1; a <= len(sa); a++ {
		for b := 1; b <= len(sb); b++ {
			if sa[a-1] == sb[b-1] {
				dp[a][b] = dp[a-1][b-1] + 1
			} else {
				dp[a][b] = max(dp[a][b-1], dp[a-1][b])
			}
		}
	}

	return dp[len(sa)][len(sb)]
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

C++: #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define rep(i,x) for(int i = 0; i < x; i++)
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> ivec;
const ll N = 1e9+7;

int main(){
    int q; cin >> q;
    string x[q],y[q];
    rep(i,q){
        cin >> x[i] >> y[i];
    }
    int ans[q];
    rep(i,q){
        int dp[1010][1010] = {};
        int xlen = x[i].size();
        int ylen = y[i].size();
        // cout << x[i] << ' ' << xlen << ' ' << y[i] << ' ' << ylen << endl;
        dp[0][0] = 0;
        rep(j,xlen+1){
            if(!j)continue;
            rep(k,ylen+1){
                if(!k)continue;
                if(x[i][j-1] == y[i][k-1]) {
                    dp[j][k] = dp[j-1][k-1] + 1;
                    // cout << i  << ' ' << j  << ' ' << k << ' ' <<  dp[j][k] << endl;
                }
                else{
                    dp[j][k] = max(dp[j-1][k],max(dp[j][k-1],dp[j-1][k-1]));
                }
            }
        }
        ans[i] = dp[xlen][ylen];
    }

    rep(i,q) cout << ans[i] << endl;
    return 0;
}

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

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

static const int N = 10000;

int lcs(string X, string Y);

int main(void){
	string s1, s2;
	int n; cin >> n;
	int i;
	REP(i, n) {
		cin >> s1 >> s2;
		cout << lcs(s1, s2) << endl;
	}
	return 0;
}

// longest common sequence
int lcs(string X, string Y){
	int c[N + 1][N + 1];
	int m = X.size();
	int n = Y.size();
	int maxl = 0;
	X = ' ' + X;
	Y = ' ' + Y;
	int i, j;
	FOR(i, 1, m + 1) FOR(j, 1, n + 1) {
		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]);
	}
	return maxl;
}

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

using namespace std;

#define N 1000

int LCS(string x, string y){
  int apx[N+1][N+1];
  int a=x.size();
  int k=y.size();
  int max_l =0;

  x=' '+x;
  y=' '+y;

  for(int i=0;i<=a;i++) apx[i][0] =0;
  for(int j=0;j<=k;j++) apx[0][j] =0;

  for(int i=1;i<=a;i++){
    for(int j=1;j<=k;j++){
      if(x[i] == y[j])  apx[i][j] = apx[i-1][j-1] +1;
      else apx[i][j] = max(apx[i-1][j],apx[i][j-1]);
      max_l=max(max_l,apx[i][j]);
    }
  }
  return max_l;
}


int main(){
  int q;
  string x,y;

  cin >> q;

  for(int i=0;i<q;i++){
    cin >> x >> y;
    cout << LCS(x,y) << endl;
  }
  return 0;


}

C++: #include <iostream>
#include <set>
#include <math.h>
#include <list>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX_N 1005
#define MAX_M 100

long long A[MAX_N];
long long B[MAX_N];
int MOD = 1000000000 + 7;
string S;

int dp[MAX_N][MAX_N];
int lcs(string S, string T)
{
    rep(i, S.length())
    {
        rep(j, T.length())
        {
            if (S[i] == T[j])
            {
                dp[i + 1][j + 1] = dp[i][j] + 1;
            }
            else
            {
                dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);
            }
        }
    }
    return dp[S.length()][T.length()];
}

int main()
{
    rep(i, MAX_N)
    {
        dp[i][0] = 0;
        dp[0][i] = 0;
    }
    int Q;
    cin >> Q;
    string S, T;
    rep(i, Q)
    {
        cin >> S >> T;
        cout << lcs(S, T) << endl;
    }

    return 0;
}

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

int lcs(string X, string Y) {
  int c[N + 1][N + 1];
  int m = X.size();
  int n = Y.size();
  int maxl = 0;
  X = ' ' + X;
  Y = ' ' + Y;
  for ( int i = 0; i <= m; i++ ) c[i][0] = 0;
  for ( int j = 1; j <= n; j++ ) c[0][j] = 0;

  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]);
    }

  return maxl;
}

int main() {
  string s1, s2;
  int n; cin >> n;
  for ( int i = 0; i < n; i++ ) {
    cin >> s1 >> s2;
    cout << lcs(s1, s2) << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <cstring>

#define LP(i,n) for(int i=0;i<n;i++)
#define Mset(x,v) memset(x,v,sizeof(x))

using namespace std;
using LL=long long;

int main(){
    int n,x,y,maxl;
    string X,Y;
    cin>>n;
    LP(i,n){
        int c[1001][1001];
        cin>>X>>Y;
        x=X.size();
        y=Y.size();
        X=' '+X;
        Y=' '+Y;
        maxl=0;
        for(int j=0;j<=x;j++) c[j][0]=0;
        for(int j=1;j<=y;j++) c[0][j]=0;
        for(int j=1;j<=x; j++){
            for(int k=1;k<=y;k++){
                if(X[j]==Y[k]){
                    c[j][k]=c[j-1][k-1]+1;
                }
                else{
                    c[j][k]=max(c[j-1][k],c[j][k-1]);
                }
                maxl=max(maxl,c[j][k]);
            }
        }
        cout<<maxl<<endl;
    }
    return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>

#define SIZE 1001
class TLcsSolver
{
    int FTable[SIZE][SIZE];
    const char* FArray1;
    const char* FArray2;
    const int Fn1;
    const int Fn2;

    int Count(int i, int j)
    {
        if(i == 0 || j == 0) return 0;
        if(FArray1[i-1] == FArray2[j-1]){
            return FTable[i-1][j-1] + 1;
        }
        return std::max(FTable[i-1][j], FTable[i][j-1]);
    }
    void Solve()
    {
        for(std::size_t i = 1; i < Fn1; ++i){
            for(std::size_t j = 1; j < Fn2; ++j){
                FTable[i][j] = Count(i, j);
            }
        }
    }
    void Print()const
    {
        for(std::size_t i = 0; i < Fn1; ++i){
            for(std::size_t j = 0; j < Fn2; ++j){
                printf("%d\t", FTable[i][j]);
            }
            printf("\n");
        }
    } 
public:
    TLcsSolver(const char* a, const char* b)
     : FArray1(a), FArray2(b)
     , Fn1(std::strlen(a)), Fn2(std::strlen(b))
    {
        Solve();
        // Print();
    }
    int Answer()const
    {
        return FTable[Fn1-1][Fn2-1];
    }
};

int main()
{
    int n;
    std::scanf("%d\n", &n);
    char a[SIZE];
    char b[SIZE];
    for(int i = 0; i < n; ++i){
        std::fgets(a, SIZE, stdin);
        std::fgets(b, SIZE, stdin);
        std::printf("%d\n", TLcsSolver(a, b).Answer());
    }
    return 0;
}