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 <iostream>
using namespace std;

constexpr int MAX = 1000;
int dp[MAX+1][MAX+1];

int main() {
  int N;
  cin >> N;
  for (int n{}; n < N; ++n) {
    string s, t;
    cin >> s >> t;
    for (size_t i{}; i < s.length(); ++i) {
      for (size_t j{}; j < t.length(); ++j) {
        if (s[i] == t[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]);
      }
    }
    cout << dp[s.length()][t.length()] << endl;
  }
  return 0;
}

C++: #include "bits/stdc++.h"
#define REP(i, m, n) for(long long i = m; i < n; ++i)
#define CO(n) cout << n << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int q;
string X[150], Y[150];
int dp[1001][1001];
//dp[i][j] Xのi文字目までとYのj文字目まででできるLSCの長さ

int main()
{
    ios::sync_with_stdio(false);
    cin >> q;
    REP(n,0,q) cin >> X[n] >> Y[n];
    REP(n,0,q){
        int lx = X[n].size(); int ly = Y[n].size();
        //dpテーブル初期化
        REP(i,0,lx+1) dp[i][0] = 0;
        REP(j,0,ly+1) dp[0][j] = 0;
        //dp
        REP(i,0,lx){
            REP(j,0,ly){
                if (X[n][i]==Y[n][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]);
            }
        }
        CO(dp[lx][ly]);
    }
    return 0;
}

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

using namespace std;

#define STRING_MAX 1000

int lcs(string X,string Y)
{
	int m = X.size();
	int n = Y.size();
	int c[STRING_MAX + 1][STRING_MAX + 1];
	int maxl = 0;

	X = ' ' + X;
	Y = ' ' + Y;


	for (int i = 1; i <= m; i++) {
		c[i][0] = 0;
	}
	
	for (int i = 1; i <= n; i++) {
		c[0][i] = 0;
	}


	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) {
			if (X[i] == Y[i]) {
				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(void)
{
	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<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;
		cin >> s2;
		cout << lcs(s1, s2) << endl;
	}
	return 0;
}

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

int main(){
  int n,b[1100][1100];
  string s1,s2;
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>s1>>s2;
    for(int j=0;j<=s1.size()+1;j++)b[j][0]=0;
    for(int j=0;j<=s2.size()+1;j++)b[0][j]=0;
    for(int j=1;j<=s1.size();j++){
      for(int k=1;k<=s2.size();k++){
	if(s1[j-1]==s2[k-1])b[j][k]=b[j-1][k-1]+1;
	else if(b[j][k-1]>b[j-1][k])b[j][k]=b[j][k-1];
	else b[j][k]=b[j-1][k];
      }
    }
    cout<<b[s1.size()][s2.size()]<<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;  // X[0] に空白を挿入
  Y = ' ' + Y;  // Y[0] に空白を挿入
  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 <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;//??¨X[0]????????\?????????
	Y=' '+Y;//??¨Y[0]????????\?????????
	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 <iostream>
#include <string>

int max(int a, int b, int c);

int main(){
    int n;
    std::cin >> n;
    std::string str1;
    std::string str2;
    for(int i=0;i<n;i++){
        std::cin >> str1;
        std::cin >> str2;
        int size1 = str1.size();
        int size2 = str2.size();
        int dp[size1+1][size2+1];
        dp[0][0] = 0;
        for(int j=0;j<=size1;j++){
            dp[j][0] = 0;
        }
        for(int j=0;j<=size2;j++){
            dp[0][j] = 0;
        }

        for(int j=1;j<=size1;j++){
            for(int k=1;k<=size2;k++){
                dp[j][k] = max(dp[j-1][k],dp[j-1][k-1],dp[j][k-1]);
                if(str1[j]==str2[k]) dp[j][k]++;
            }
        }

        std::cout << dp[size1][size2] << std::endl;
    }
    return 0;
}

int max(int a, int b, int c){
    if(a>b){
        if(a>c){
            return a;
        }else{
            return c;
        }
    }else{
        if(b>c){
            return b;
        }else{
            return c;
        }
    }
}

C++: #include<stdio.h>
#include<string.h>

int main(){
  char X[1001],Y[1001];
  int i,j,n,x,y,k;
  int l[1001][1001];  
  scanf("%d",&n);
  
  for(k=0;k<n;k++){
    
    scanf("%s%s",X,Y);
    x=strlen(X);
    y=strlen(Y);
    
    for(i=0;i<=x;i++){
      for(j=0;j<=y;j++){
	l[i][j]=0;
      }	
    }
    
    for(i=1;i<=x;i++){
      for(j=1;j<=y;j++){
	if(X[i]==Y[j])  l[i][j]=l[i-1][j-1]+1;
	else if(l[i-1][j]>=l[i][j-1]) l[i][j]=l[i-1][j];
	else l[i][j]=l[i][j-1];
      }
    }
    printf("%d\n",l[i-1][j-1]);
    
  }
}

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

using namespace std;

int max(int x, int y) {
	return x > y ? x : y;
}

int lcs(string x, string y) {
	int l1 = x.size(),l2 = y.size();
	vector<vector<int> > dp(l1 + 1, vector<int>(l2 + 1, 0));
	for (int i = 1;i <= l1;i++) {
		for (int j = 1;j <= l2;j++) {
			if (l1 == 0 || l2 == 0) {
				dp[i][j] = 0;
			}
			else if (x[i - 1] == y[j - 1]) {
				dp[i][j] = dp[i - 1][j - 1] + 1;
			}
			else {
				dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
			}
		}
	}
	return dp[l1][l2];
}


int main() {
	int n;
	cin >> n;

	for (int i = 1;i <= n;i++) {
		string x, y;
		cin >> x;
		cin >> y;
		cout << lcs(x, y) << endl;

	}
	return 0;
}