Go: package main

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

func main() {
	for q := ReadInt(); q > 0; q-- {
		x, y := ReadString(), ReadString()
		fmt.Println(LCS(x, y))
	}
}

func LCS(x, y string) int {
	dp := make([][]int, len(x)+1)
	for i := 0; i < len(x)+1; i++ {
		dp[i] = make([]int, len(y)+1)
	}
	for i := 0; i < len(x); i++ {
		for j := 0; j < len(y); j++ {
			dp[i+1][j+1] = Max(dp[i+1][j], dp[i][j+1])
			if x[i] == y[j] {
				dp[i+1][j+1] = Max(dp[i+1][j+1], dp[i][j]+1)
			}
		}
	}
	return dp[len(x)][len(y)]
}

func Max(xs ...int) int {
	max := xs[0]
	for _, x := range xs[1:] {
		if max < x {
			max = x
		}
	}
	return max
}

var reader = bufio.NewReader(os.Stdin)

func Scan(a ...interface{}) {
	if _, err := fmt.Fscan(reader, a...); err != nil {
		panic(err)
	}
}
func ReadInt() (i int)       { Scan(&i); return }
func ReadString() (s string) { Scan(&s); return }
func ReadInts(n int) []int {
	v := make([]int, n)
	for i := 0; i < n; i++ {
		Scan(&v[i])
	}
	return v
}

C++: #include "bits/stdc++.h"
using namespace std;
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    string a, b;
    for (int i = 0; i < n; i++)
    {
        cin >> a >> b;
        a = ' ' + a;
        b = ' ' + b;
        vector<vector<int>> dp(a.length(), vector<int>(b.length(), 0));
        for (int j = 1; j < a.length(); j++)
        {
            for (int k = 1; k < b.length(); k++)
            {
                if(a[j] == b[k])
                {
                    dp[j][k] = dp[j - 1][k - 1] + 1;
                }
                else
                {
                    dp[j][k] = max(dp[j - 1][k], dp[j][k - 1]);
                }
            }
        }
        cout << dp[a.length() - 1][b.length() - 1] << "\n";
    }
}

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

int dp[1005][1005];

int main() {
    int q;
    cin >> q;
    vector<int> ans;
    rep(_,q) {
        string x, y;
        cin >> x >> y;
        rep(i,x.size())rep(j,y.size()) {
            if (x[i] == y[j]) dp[i+1][j+1] = dp[i][j] +1;
            else dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j]);
        }
        ans.push_back(dp[x.size()][y.size()]);
        rep(i,x.size())rep(j,y.size()) dp[i][j] = 0;
    }
    rep(i,q) cout << ans[i] << endl;
}

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 = 1; 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 <cstdio>
#include <cstdlib>
#include <string>
#include <iostream>

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

    for(i=1;i<m;i++){
        for(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][j-1],c[i-1][j]);
            }
            maxl=max(maxl,c[i][j]);
        }
    }
    return maxl;
}
int main()
{
    int n;
    string s1,s2;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>s1>>s2;
        cout<<lcs(s1,s2)<<endl;
    }
    
    return 0;
}

C++: #include<math.h>
#include<limits.h>
#include<iostream>
#include<string>
#include<vector>
#include<stdio.h>
#include<sstream>
#include<list>
#include<queue>
#include<algorithm>
#include<functional>
#include<map>
#include<set>
//#include<utility>
//#include<initializer_list>
//#include<tuple>
//#include<regex>
using namespace std;
#define ull unsigned long long
#define ll long long
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define all(t) t.begin(), t.end()
bool isSubstring(string substr, string t) {
	int n = substr.length();
	int seek = 0;
	rep(i, n) {
		bool ex = 0;
		for (int j = seek; j < t.length(); j++) {
			if (substr[i] == t[j]) {
				ex = 1;
				seek = j + 1;
				break;
			}
		}
		if (ex) {
			continue;
		}
		else {
			return false;
		}
	}
	return true;

}

int LongestCommonSubstring(string s, string t) {
	// Wrong plan
	vector<int>dp(s.length(), 0);
	int n = s.length();
	string lcs = "";
	if (isSubstring(s.substr(n - 1, n), t)) {

		dp[n - 1] = 1;
		lcs = s[n - 1];
	}
	for (int i = n - 2; i >= 0; i--) {
		//string substr = s.substr(i, n);
		string substr = s[i] + lcs;
		int issubst = isSubstring(substr, t);
		if (issubst) lcs = substr;
		dp[i] = dp[i + 1] + issubst;
	}
	return dp[0];
}
int LongestCommonSubstring2(string s, string t) {
	vector<vector<int>> dp(s.length(), vector<int>(t.length(), 0));
	int n = s.length();
	int m = t.length();
	rep(i, n - 1) {
		rep(j, m - 1) {
			dp[i + 1][m + 1] = s[i] == t[j] ? dp[i][j] + 1 : max(dp[i][j + 1], dp[i + 1][j]);
		}
	}
	return dp[n - 1][m - 1];
}
int main() {
	//cout << isSubstring("abc", "abcde") << endl;
	//cout << isSubstring("bd", "abcde") << endl;
	//cout << isSubstring("db", "abcde") << endl;

	//cout << LongestCommonSubstring("bacd", "becd") << endl;
	//cout << LongestCommonSubstring("abcd", "becd") << endl;
	//cout << endl;
	//cout << LongestCommonSubstring("a", "a") << endl;
	//cout << LongestCommonSubstring("bbb", "bbb") << endl;
	//cout << LongestCommonSubstring("aba", "bbaba") << endl;
	//cout << LongestCommonSubstring("abababbbaa", "bbabaabba") << endl;
	//cout << LongestCommonSubstring("a", "aaaaa") << endl;
	//cout << LongestCommonSubstring("aizojfeiz", "aaaizojifeizz") << endl;
	//cout << LongestCommonSubstring("zzyiioxizu", "zzsyoizuo") << endl;
	//cout << LongestCommonSubstring("iooooioiooiio", "ooiiioioiooooiioio") << endl;
	//cout << LongestCommonSubstring("ajfoaooieellzljieoaelj", "ajoiiffoaolliseellzljieoaelj") << endl;
	//cout << LongestCommonSubstring("zzzzzyyzyy", "zzyyyyz") << endl;
	//cout << LongestCommonSubstring("abcdef", "fedcba") << endl;
	//cout << LongestCommonSubstring("abc", "xyz") << endl;
	int q;
	cin >> q;
	vector<string> s(q);
	vector<string> t(q);
	rep(i, q) {
		cin >> s[i] >> t[i];
	}
	rep(i, q) {
		cout << LongestCommonSubstring2(s[i], t[i]) << endl;
	}

	return 0;
}

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

using namespace std;

int main() {

	int n;
	string A, B;
	int sizA, sizB, max=0;
	int c[1001][1001];
	
	cin >> n;
	
	for (int i = 0;i < n;++i) {
		cin >> A >> B;
		sizA = (int)(A.length());
		sizB = (int)(B.length());

		for (int a = 0;a <= sizA;++a) {
			for (int b = 0;b <= sizB;++b) {
				if (a == 0 || b == 0) {
					c[a][b] = 0;
				}else if(A[a-1]==B[b-1]){
					c[a][b] = c[a-1][b-1]+1;
				}else if(c[a][b-1]>c[a-1][b]){
				    c[a][b] = c[a][b-1];
				}else{
				    c[a][b] = c[a-1][b];
				}



				if (max < c[a][b]) {
					max = c[a][b];
				}
			}
		}
		cout << max << endl;
		max = 0;
	}
	return 0;
}