Go: package main

import (
	. "fmt"
    "math"
)

// func init() { Println("----------------------------------------") }

func main() {
    const L_MAX = 1003

	var q int
	Scanf("%d", &q)
	X := make([]string, 0, 150)
	Y := make([]string, 0, 150)
	for i := 0; i < 2 * q; i++ {
	    var tmp string
	    Scanf("%s", &tmp)

	    if i % 2 == 0 {
	        X = append(X, tmp)
	    } else {
	        Y = append(Y, tmp)
	    }
	}

    for i := 0; i < q; i++ {
        dp := make([][]int, L_MAX)
        for k, _ := range dp {
            dp[k] = make([]int, L_MAX)
        }

        x, y := X[i], Y[i]

        // init
        isXFound := false
        for c := 0; c < len(x); c++ {
            if isXFound || y[0] == x[c] {
                dp[0][c] = 1
                isXFound = true
            }
        }
        isYFound := false
        for r := 0; r < len(y); r++ {
            if isYFound || x[0] == y[r] {
                dp[r][0] = 1
                isYFound = true
            }
        }

        for r := 1; r < len(y); r++ {
            for c := 1; c < len(x); c++ {
                // dp[r][c]
                if x[c] == y[r] {
                    dp[r][c] = int(math.Max(float64(dp[r - 1][c - 1] + 1), float64(dp[r][c])))
                }

                dp[r][c] = int(math.Max(float64(dp[r][c]), math.Max(float64(dp[r - 1][c]), float64(dp[r][c - 1]))))
            }
        }
        Println(dp[len(y) - 1][len(x) - 1])

        // LCSも求めておく
        // ans := ""
        // r, c := len(y) - 1, len(x) - 1
        // for r >= 0 && c >= 0 {
        //     if y[r] == x[c] {
        //         ans = string(x[c]) + ans
        //         r--
        //         c--
        //     } else {
        //         if dp[r - 1][c] > dp[r][c - 1] {
        //             r--
        //         } else {
        //             c--
        //         }
        //     }
        // }
        // Println(ans)
    }
}

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

static const int N = 1000;

int lcs(string X,string Y){
    int c[N+1][N+1];    //c[i][k]???Xi??¨Yk???LCS??¨??????????????????
    int m = X.size();
    int n = Y.size();
    int maxl = 0;
    X = ' ' + X; // X[0]?????????????????\
    Y = ' ' + Y;
    for(int i=1;i<=m;i++) c[i][0] = 0;
    for(int k=1;k<=n;k++) c[0][k] = 0;

    for(int i=1;i<=m;i++){
        for(int k=1;k<=n;k++){
            if(X[i]==Y[k]){
                c[i][k] = c[i-1][k-1] + 1;
            } else {
                c[i][k] = max(c[i-1][k],c[i][k-1]);
            }
            maxl = max(maxl,c[i][k]);
        }
    }

    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<vector>
//#include<algorithm>

const static int MAX = 1001;
std::string X, Y;
int LCS[MAX][MAX];

int main(void){
    int q, x_size, y_size;
    std::cin >> q;
    for(int i = 0; i < q; i++){
	std::cin >> X >> Y;
	LCS[0][0] = 0;
	LCS[0][1] = 0;
	LCS[1][0] = 0;
	x_size = X.size();
	y_size = Y.size();
	for(int j = 0; j < X.size(); j++){
	    for(int k = 0; k < Y.size(); k++){
		if(X[j] == Y[k]){
		    LCS[j+1][k+1] = LCS[j][k] + 1;
		}else if(X[j] != Y[k]){
		    LCS[j+1][k+1] = std::max(LCS[j][k+1], LCS[j+1][k]);
		}
	    }
	}
	std::cout << LCS[x_size][y_size] << std::endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define pl pair<ll,ll>
#define rep(i,b) for(ll i=0;i<b;i++)
#define all(v) (v).begin(),(v).end()

ll lcs(string X,string Y){
    ll c[1001][1001];
    ll m=X.size();
    ll n=Y.size();
    ll maxl=0;
    X=' '+X;
    Y=' '+Y;
    for (int i = 0; i <=m ; ++i)c[i][0]=0;
    for (int j = 0; 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;
ll n;cin>>n;
rep(i,n){
    cin>>s1>>s2;
    cout<<lcs(s1,s2)<<endl;
}
}

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

static int N=1000;

int lcs(string x,string y){
  int num[N+5][N+5];
  int ans=0;
  int leng_x=x.size();
  int leng_y=y.size();  
  
  x=' '+x;
  y=' '+y;

  for(int i=1;i<=leng_x;i++)num[i][0]=0;
  for(int i=1;i<=leng_y;i++)num[0][i]=0;
  

  for(int i=1;i<=leng_x;i++){
    for(int j=1;j<=leng_y;j++){
      if(x[i]==y[j]) num[i][j]=num[i-1][j-1]+1;
      else num[i][j]=max(num[i][j-1],num[i-1][j]);
      ans=max(ans,num[i][j]);
    }
  }
  return ans;
}

int main(){
  string s1,s2;
  int q;

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

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
inline void chmax (int& a, int b) {
  if (a < b) a = b;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int q;
  cin >> q;
  while (q--) {
    string x, y;
    cin >> x >> y;
    int m = x.length();
    int n = y.length();
    vector<int> dp(n + 1, 0);
    for (int i = 1; i <= m; i++) {
      for (int j = 1; j <= n; j++) {
        chmax(dp[j], dp[j - 1]);
        if (x[i - 1] == y[j - 1]) dp[j] = dp[j - 1] + 1;
      }
    }
    int ret = dp[n];
    cout << ret << '\n';
  }
  return 0;
}