Go: package main

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

type Position struct {
	X int
	Y int
}

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 {
	return lcs(strX, strY, Position{0, 0}, make(map[Position]int))
}

func lcs(strX string, strY string, position Position, memo map[Position]int) int {
	if position.X >= len(strX) || position.Y >= len(strY) {
		return 0
	}
	if v, ok := memo[position]; ok {
		return v
	}
	if strX[position.X] == strY[position.Y] {
		result := lcs(strX, strY, Position{position.X + 1, position.Y + 1}, memo)
		memo[position] = result + 1
		return memo[position]
	} else {
		result1 := lcs(strX, strY, Position{position.X + 1, position.Y}, memo)
		result2 := lcs(strX, strY, Position{position.X, position.Y + 1}, memo)
		var result int
		if result1 > result2 {
			result = result1
		} else {
			result = result2
		}
		memo[position] = result
		return result
	}
}

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<bits/stdc++.h>

using namespace std;

void printdpTable(vector<vector<int> > a){
    cout << "- dp table -" << endl;
    for(int i = 0; i < a.size(); i++){
        for(int j = 0; j < a[0].size(); j++){
            cout << a[i][j] << " ";
        }
        cout << endl;
    }
    cout << "- dp table -" << endl;
}

//すべての最長部分文字列をの長さ出力する
void printLcs(string x, string y){
    int n = x.length();
    int m = y.length();
    vector<vector<int> > a(n+1, vector<int>(m+1, 0));
    x = ' ' + x;
    y = ' ' + y;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(x[i] == y[j]){
                a[i][j] = a[i-1][j-1]+1;
            }else{
                a[i][j] = max(a[i-1][j], a[i][j-1]);
            }
        }
    }
    cout << a[n][m] << endl;
}

int main(void){
    int n;
    cin >> n;
    string x, y;
    for(int i = 0; i < n; i++){
        cin >> x >> y;
        printLcs(x,y);
    }
    return 0;
}

C++: #include "iostream"
#include "string.h"

using namespace std;

int L[1001][1001];

int lcs( char s1[], char s2[], int l1, int l2 ) {

	if (L[l1][l2] != 0)return L[l1][l2];

	if (l1 == 0 || l2 == 0) return 0;
	else if (s1[l1-1] == s2[l2-1]) L[l1][l2] = lcs(s1, s2, l1 - 1, l2 - 1) + 1;
	else {
		int lsc1 = lcs(s1, s2, l1 - 1, l2);
		int lsc2 = lcs(s1, s2, l1, l2 - 1);

		if (lsc1 > lsc2) L[l1][l2] = lsc1;
		else L[l1][l2] = lsc2;
	}

	return L[l1][l2];
}

int main() {

	int n;
	char s1[1000], s2[1000];

	cin >> n;

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

		cout << lcs(s1, s2, strlen(s1), strlen(s2)) << endl;
	}

	return 0;
}

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

int max(int a,int b);

int main() {
  int q;
  cin >> q;
  for (int i=0;i<q;++i) {
    string str1,str2;
    cin >> str1 >> str2;
    int size1 = str1.size();
    int size2 = str2.size();
    int matrix[size1+1][size2+1];
    for (int j=0;j<=size1;++j)
      matrix[j][0] = 0;
    for (int j=0;j<=size2;++j)
      matrix[0][j] = 0;
    for (int j=1;j<=size1;++j) {
      for (int k=1;k<=size2;++k) {
	if (str1[j-1]==str2[k-1]) {
	  matrix[j][k] = 1 + matrix[j-1][k-1];
	}
	else {
	  matrix[j][k] = max(matrix[j][k-1],matrix[j-1][k]);
	}
      }
    }
    cout << matrix[size1][size2] << endl;
  }
}

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

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstdlib>
#include <cmath>
#include<stdio.h>
#include<queue>
#define MAX 1000000000000000000LL
long long inf=1000000007;
using namespace std;
    int H,A[2000001];

int lcs(string X,string Y){
    int  c[1001][1001];
    long long m=X.size();
    long long  n=Y.size();
    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[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 <cstring>
#include <algorithm>
using namespace std;
char x[1007], y[1007];
int dp[1007][1007];
int main() {
    int q;
    scanf("%d", &q);
    while (q--) {
    	scanf("%s%s", x, y);
    	int xlen = strlen(x), ylen = strlen(y);
    	for (int i = 1; i <= xlen; i++) {
    		for (int j = 1; j <= ylen; j++) {
    			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]);
			}
		}
		printf("%d\n", dp[xlen][ylen]);
	}
    return 0;
}

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

int Lcs(string X, string Y) {
  vector< vector<int> > dp(X.size() + 1, vector<int>(Y.size() + 1));
  X = ' ' + X, Y = ' ' + Y;
  for (int i = 1; i <= X.size() - 1; ++i) {
    for (int j = 1; j <= Y.size() - 1; ++j) {
      if (X[i] == Y[j])
        dp[i][j] = dp[i - 1][j - 1] + 1;
      else
        dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
    }
  }
  return dp[X.size() - 1][Y.size() - 1];
}

int main() {
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    string X, Y;
    cin >> X >> Y;
    cout << Lcs(X, Y) << 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 = 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;
    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>
using namespace std;

#define MAX 150
#define MAXL 1000

int C[MAXL+1][MAXL+1];

int lec(string X,string Y)
{
    int XL = X.length();
    int YL = Y.length();
    for(int i=0;i<XL;i++)
        C[i][0] = 0;
    for(int i=0;i<=YL;i++)
        C[0][i] = 0;
    for(int i=0;i<=XL;i++)
    {
        for(int j=0;j<YL;j++)
        {
            if(X[i]==Y[j])
            {
                C[i+1][j+1] = C[i][j]+1;
            }
            else if(C[i][j+1] > C [i+1][j])
            {
                C[i+1][j+1] = C[i-1][j+1];
            }else{
                C[i+1][j+1] = C[i+1][j];
            }
        }
    }
    return C[XL][YL];
}

int main()
{
    int q;
    string x,y;
    cin>>q;
    for(int i=0;i<q;i++)
    {
        cin>>x>>y;
        cout<<lec(x,y)<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[1001][1001];

int main(){
	int n; cin >> n;
	while (n--){
		string X, Y; cin >> X >> Y;
		memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= X.size(); ++i){
			for (int j = 1; j <= Y.size(); ++j){
				if (X[i-1] == Y[j-1]) dp[i][j] = max(dp[i][j-1],max(dp[i-1][j],dp[i-1][j-1]+1));
				else dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
			}
		}
		cout << dp[(int)X.size()][(int)Y.size()] << '\n';
	}
}