Go: package main

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

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}
	for i := 0; i < n; i++ {
		strX := nextText(sc)
		strY := nextText(sc)
		fmt.Println(calcLcs(strX, strY))
	}
}

func calcLcs(strX, strY string) int {
	lenX, lenY := len(strX), len(strY)
	memo := make([][]int, lenX+1)
	for i := 0; i < lenX+1; i++ {
		memo[i] = make([]int, lenY+1)
	}

	lcs := 0
	for i := 1; i < lenX+1; i++ {
		for j := 1; j < lenY+1; j++ {
			if strX[i-1] == strY[j-1] {
				memo[i][j] = memo[i-1][j-1] + 1
			} else {
				if memo[i-1][j] > memo[i][j-1] {
					memo[i][j] = memo[i-1][j]
				} else {
					memo[i][j] = memo[i][j-1]
				}
			}
			if memo[i][j] > lcs {
				lcs = memo[i][j]
			}
		}
	}
	return lcs
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

func nextText(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

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

long int dp[10000][10000];
string  s1, s2;
void solve(){
  for(int i=0;i<=max(s1.size(),s2.size())+1;i++){
     dp[i][i]=0;
  }
  int val;
  for(int x=1;x<=s1.size();x++){
    for(int y=1;y<=s2.size();y++){
	  if(s1[x]==s2[y]){
	    val = max(dp[x-1][y-1]+1,max(dp[x-1][y],dp[x][y-1]));
	  }else{
	    val = max(dp[x-1][y-1],max(dp[x-1][y],dp[x][y-1]));
          }
          dp[x][y] = val;
    }
  }/*
    for(int x=1;x<=s1.size();x++){
    for(int y=1;y<=s2.size();y++){
      cout<<dp[x][y]<<" ";
    }
    cout<<endl;
    }*/
    cout<<dp[s1.size()][s2.size()]<<endl;
}

int main(){ 
  int n;
   cin>>n;
   for(int i=0; i<n; i++){
      cin>>s1>>s2;
      solve();
   }
   return 0;
}

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

using namespace std;

int LCS(string a, string b);
int S[1001][1001];

int main() {
    int n;
    cin >> n;
    string a, b;

    vector<int> ans;
    
    for (int i = 0; i < n; i++) {
        cin >> a;
        cin >> b;
        ans.push_back(LCS(a, b));
    }
    for (int i = 0; i < n; i++) {
        cout << ans[i] << '\n';
    }
}

int LCS(string a, string b) {

    int len_a = a.size();
    int len_b = b.size();
    for (int i = 1; i <= len_a; i++) {
        for (int j = 1; j <= len_b; j++) {
            if (a[i-1] == b[j-1]) S[i][j] = S[i-1][j-1] + 1;
            else {
                S[i][j] = max(S[i][j-1], S[i-1][j]);
            }
        }
    }

    return S[len_a][len_b];
}

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>;

vector<int>bitSearch(int bit,int n){
    vector<int>S;
    rep(i,n)if(bit&(1<<i))S.push_back(i);
    return S;
}

int main(){
    int q;
    while(cin>>q){
        rep(i,q){
            string s,t;cin>>s>>t;
            int m = s.size(),n = t.size();
            s.insert(0,"0");
            t.insert(0,"0");
            int dp[m+1][n+1];
            rep(j,m+1)rep(k,n+1)dp[j][k] = 0;
            REP(j,1,m){
                REP(k,1,n){
                    if(s[j] == t[k]){
                        dp[j][k] = max({dp[j][k],dp[j-1][k-1]+1,dp[j-1][k],dp[j][k-1]});
                    }
                    else dp[j][k] = max({dp[j][k],dp[j-1][k],dp[j][k-1]});
                }
            }
            cout<<dp[m][n]<<endl;
        }
    }
}

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

int main(int argc, char const *argv[]) {
        int x; cin>>x;

        while (x--) {
                string s,t; cin>>s>>t;
                int n = s.length(); int m = t.length();
                vector<vector<int> > dp(n+1, vector<int>(m+1, 0));
                for (int i = 1; i <= n; ++i) {
                        for (int j = 1; j <= m; j++) {
                                if (s[i-1]==t[j-1]) dp[i][j] = max(dp[i][j], dp[i-1][j-1]+1);
                                else {
                                        dp[i][j] = max(dp[i][j], max(dp[i-1][j], dp[i][j-1]));
                                }
                        }
                }
                cout << dp[n][m] << endl;
        }

        return 0;
}

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

int main() {
  int q; cin >> q;
  string A, B; cin >> A >> B;
  for (int i=0; i<q; i++) {
    vector<vector<int>> LCS(A.length()+1, vector<int>(B.length()+1,0));
    for (int j=1; j<=A.length(); j++) {
      for (int k=1; k<=B.length(); k++) {
        if(A[j]==B[k]) LCS[j][k]=LCS[j-1][k-1]+1;
        else LCS[j][k] = max(LCS[j-1][k],LCS[j][k-1]);
      }
    }
    cout << LCS[A.length()][B.length()]
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
long long dp[1002][1002];
int main() {
  int n;cin>>n;
  for(int i=0; i<n; i++){
  
  string a,b; cin>>a>>b;
  int al=a.size(); int bl=b.size();
  for (int i=0;i<1002;i++){for(int j=0;j<1002;j++){dp[i][j]=0;}}
  for (int j=0;j<al;j++){
  for (int k=0;k<bl;k++){
  if(a[j]==b[k]){dp[j+1][k+1]=dp[j][k]+1;}
  else{dp[j+1][k+1]=max(dp[j+1][k],dp[j][k+1]);}
  }
  }
  cout << dp[al][bl] << endl;
  }
}

C++: #include<iostream>
#include<vector>
#include<string>
using namespace std;
string s1,s2;
int memo[100][100];

int solve(int l1,int l2){
  if(memo[l1][l2] < 0)return memo[l1][l2];
  if(l1 < 0 or l2 < 0)return 0;
  //cout << s1[l1] << s2[l2] << endl;
  if(s1[l1] == s2[l2]){
    return memo[l1][l2] = solve(l1 - 1,l2 - 1) + 1;
  }
  return memo[l1][l2] = max(solve(l1,l2-1), solve(l1-1,l2));
}
int main(){
  int n;
  cin >> n;
  for(int i = 0;i < n;i++){
    fill(*memo,*(memo+100),-1);
    cin >> s1 ;
    cin >> s2;
    cout << solve(s1.length(),s2.length()) - 1 << endl;
  }
}

C++: #include <iostream>
#include <cmath>
#define MAX_NUMBER 1001

using namespace std;

int main () {
  // 最长公共子序列
  int n;
  string x, y;
  int lcs, c[MAX_NUMBER][MAX_NUMBER];

  cin >> n;

  for (int k = 0; k < n; k++) {
    cin >> x;
    cin >> y;

    x = " " + x;
    y = " " + y;
    lcs = 0;
    for (int i = 0; i < MAX_NUMBER; i++)
      for (int j = 0; j < MAX_NUMBER; j++)
        c[i][j] = 0;
    
    for (int i = 1; i < x.length(); i++) {
      for (int j = 1; j < y.length(); 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]);
      }
    }

    cout << c[x.length() - 1][y.length() - 1] << endl;
  }

  return 0;
}

C++: #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s1[1005];
char s2[1005];
int chang[1005][1005];
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%s%s",s1,s2);
        int sl1=strlen(s1);
        int sl2=strlen(s2);
        for(int i=0;i<=sl1;i++){
                chang[i][0]=0;
        }
        for(int i=0;i<=sl2;i++){
                chang[0][i]=0;
        }
        for(int i=1;i<=sl1;i++){
            for(int j=1;j<=sl2;j++){
                if(s1[i]==s2[j]){
                    chang[i][j]=chang[i-1][j-1]+1;
                }
                else {
                    chang[i][j]=max(chang[i-1][j],chang[i][j-1]);
                }
            }
        }
        printf("%d\n",chang[sl1][sl2]);
    }
    return 0;
}