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;
#define N 1050
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(){
  int q;cin>>q;
  while(q--){
    string a,b;cin>>a>>b;
    cout<<lcs(a,b)<<endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int lcs(string X, string Y) {
  int memo[1010][1010];
  int maxl = 0;

  // 初期化、境界条件を考慮して場合分け
  for (int i = 0; i < X.size(); i++) {
    if (X[i] == Y[0]) {
      memo[i][0] = 1;
    } else {
      memo[i][0] = 0;
    }
  }

  for (int j = 0; j < Y.size(); j++) {
    if (X[0] == Y[j]) {
      memo[0][j] = 1;
    } else {
      memo[0][j] = 0;
    }
  }

  for (int i = 0; i < X.size(); i++) {
    for (int j = 0; j < Y.size(); j++) {
      if (X[i] == Y[j]) {
        memo[i][j] = memo[i-1][j-1] + 1;
      } else {
        memo[i][j] = max(memo[i-1][j], memo[i][j-1]);
      }
      maxl = max(maxl, memo[i][j]);
      //cout << i << "," << j << "," << X[i] << "," << Y[j] << "," << maxl << endl;
    }
  }
  return maxl;
}

int main() {
  int q; cin >> q;
  for (int i = 0; i < q; i++) {
    string X, Y; cin >> X >> Y;
    //cout << endl;
    cout << lcs(X, Y) << endl;
  }
}

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

using namespace std;

const int kMax = 1000 + 10;

char a_str[kMax], b_str[kMax];
int dp[kMax][kMax];

int main() {
    int q;
    scanf("%d", &q);
    while(q --) {
        scanf("%s%s", a_str, b_str);
        int n = strlen(a_str), m = strlen(b_str);
        for(int i = 0;i < n;++ i) {
            for(int j = 0;j < m;++ j) {
                if(a_str[i] == b_str[j]) dp[i][j] = (i && j ? (dp[i-1][j-1] + 1) : 1);
                else dp[i][j] = max(i ? dp[i-1][j] : 0, j ? dp[i][j-1] : 0);
            }
        }
        printf("%d\n", dp[n-1][m-1]);
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int LCS(string &X, string &Y) {
  X = " " + X;
  Y = " " + Y;
  int X_size = X.size(), Y_size = Y.size();
  vector<vector<int>> CS(Y_size, vector<int>(X_size, 0));
  for (int i = 0; i < Y_size; i++) {
    for (int j = 0; j < X_size; j++) {
      if (i == 0 || j == 0) continue;
      else if (X[j] == Y[i]) {
        CS[i][j] = CS[i - 1][j - 1] + 1;
      } else {
        CS[i][j] = max(CS[i][j - 1], CS[i - 1][j]);
      }
    }
  }
  return CS[Y_size - 1][X_size - 1];
}
int main() {
  int q;
  cin >> q;
  string X, Y;
  for (size_t i = 0; i < q; i++) {
    cin >> X >> Y;
    cout << LCS(X, Y) << endl;

    X.clear();
    Y.clear();
  }
}

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

int dp[1005][1005];
int q,n,m;
string x,y;

int main() {
	cin >> q;
	for(int a = 0; a < q; a++){
		cin >> x >> y;
		n = x.size();
		m = y.size();
		for(int i = 0; i < n; i++){
			for(int j = 0; j < m; j++){
			if		(x[i] == y[j]) dp[i+1][j+1] = dp[i][j] + 1;
			else if (x[i] != y[j]) dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j]);
			}
		}
		cout << dp[n][m] << 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 <bits/stdc++.h>
using namespace std;

int main(){
        int q;
        cin >> q;
        for(int k = 0; k < q; k++){
                string x, y;
                cin >> x >> y;
                int n = x.size(), m = y.size();
                int l[n + 1][m + 1];
                for(int j = 0; j <= m; j++){
                        for(int i = 0; i <= n; i++){
                                if(i == 0 || j == 0) l[i][j] = 0;
                                else if(x[i - 1] == y[j - 1]) l[i][j] = 1 + l[i - 1][j - 1];
                                else l[i][j] = max(l[i - 1][j], l[i][j - 1]);
                        }
                }
                cout << l[n][m] << endl;
        }
        return 0;
}

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

using namespace std;

int main(void) {
	int noq,nmax,res;
	cin >> noq;
	string t1,t2,X,Y;
	for (int q = 0; q < noq; ++q) {
		cin >> t1 >> t2;
		if (t1.length() < t2.length()) {
			X = t2;
			Y = t1;
		}
		else {
			X = t1;
			Y = t2;
		}
		vector<int> dp(X.length(),0);
		for (int i = 0; i < Y.length(); ++i) {
			nmax = 0;
			for (int j = 0; j < X.length(); ++j) {
				if (Y[i] == X[j]) {
					if (nmax+1 > dp[j]) {
						dp[j] = nmax+1;
					}
					else {
						nmax = max(dp[j],nmax);
					}
				}
				else {
					if (dp[j] < nmax) {
						dp[j] = nmax;
					}
					else {
						nmax = dp[j];
					}
				}
			}
		}
		res = 0;
		for (int i = 0; i < X.length(); ++i) {
			res = max(dp[i],res);
		}
		cout << res << endl;
	}
	return 0;
}