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 <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>

#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x);
#define if_range(x, w, h) if (w <= x && x <= h)
#define BitCheck(a,b)   (a >> b) & 1
#define BitSet(a,b)       a |= (1 << b)
#define BitunSet(a,b)    a &= ~(1 << b)

int compare_int(const void* a, const void* b) { return *(int*) a - *(int*) b; }

int main() {
	int n, m, a, dp[102][102] = { 0 };
	char s[1001], t[1001];
	scanf("%d", &a);
	for (int k = 0; a > k; k++) {
		scanf("%s %s", s, t);
		n = strlen(s);
		m = strlen(t);
		for (int i = 1; n >= i; i++) {
			for (int j = 1; m >= j; j++) {
				if (s[i - 1] == t[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[n][m]);
	}
	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.length();
    int n=Y.length();
    int maxlcs=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]);
            }
            maxlcs=max(maxlcs,c[i][j]);
        }
    }
    return maxlcs;
}

int main(){
    string a1,a2;
    int n;
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> a1 >> a2;
        cout << lcs(a1,a2) << endl;
    }
    return 0;
}

C++: #include <stdio.h>

int t[1001][1001];
 
int main(){
  char X[1000],Y[1000];
  int i, j, n, x, y, k;
 
  scanf("%d",&n);
 
  for(k=0; k<n; k++){
    scanf("%s%s",X+1,Y+1);
    x=strlen(X+1);
    y=strlen(Y+1);
 
    for(i=1; i<=x; i++)
      for(j=0; j<=y;j++)
    t[i][j]=0;
 
    for(i=1;i<=x;i++){
      for(j=1;j<=y;j++){
    if(X[i] == Y[j])  t[i][j]=t[i-1][j-1]+1;
    else if(t[i-1][j]>=t[i][j-1]) t[i][j]=t[i-1][j];
    else t[i][j]=t[i][j-1];
      }
    }
    printf("%d\n", t[i-1][j-1]);
  }
  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 = 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;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;

int dp[1010][1010];

void LCS(string X, string Y) {
    rep(i, X.size()+1) rep(j, Y.size()+1) dp[i][j] = 0;

    rep(i, X.size()) rep(j, Y.size()) {
        if (X[i] == Y[j]) dp[i+1][j+1] = max({dp[i][j]+1, dp[i][j+1], dp[i+1][j]});
        else dp[i+1][j+1] = max({dp[i][j], dp[i][j+1], dp[i+1][j]});
    }

    cout << dp[X.size()][Y.size()] << endl;
}


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

    rep(i, q) {
        string x, y;
        cin >> x >> y;

        LCS(x, y);
    }

    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 i,j;
  int maxl=0;
  X=' '+X;
  Y=' '+Y;
 
  for(i=1;i<=m;i++) c[i][0]=0;
  for(j=1;j<=n;j++) c[0]c[j]=0;

  for(i=1;i<=m;i++){
    for(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)<<enl;
  }
  return 0;
}

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

int main(void){
	int q;
	string a,b;
	cin>>q;
	while(q--){
		cin>>a>>b;
		int dp[1010][1010] = {0};
		for(int j = 0 ; j < a.size() ; j ++){
			for(int i = 0 ; i < b.size() ; i ++){
				if(a[j] == b[i]){
					dp[j+1][i+1] = dp[j][i]+ 1;
				}else{
					dp[j+1][i+1] = max(dp[j][i+1],dp[j+1][i]);
				}
			}
		}
		cout<<dp[a.size()][b.size()]<<endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int dp[1001][1001];
int main()
{
    int q;
    cin >> q;
    rep(i, q) {
        string A, B;
        cin >> A >> B;
        rep(i, A.size()) {
            rep(j, B.size()) {
                dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);
                if (A[i] == B[j]) chmax(dp[i + 1][j + 1], dp[i][j] + 1);
            }
        }
        cout << dp[(int)A.size()][(int)B.size()] << endl;
    }
    return 0;
}

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

using namespace std;

int lcs(string a, string b)
{
	vector<vector<int> > dp(1001, vector<int>(1001));
	for (int i = 0; i < a.size(); ++i)
	{
		for (int j = 0; j < b.size(); ++j)
		{
			if (a[i] == b[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]);
			}
		}
	}
	return(dp[a.size()][b.size()]);
}

void solve()
{
	int q;
	cin >> q;
	for (int i = 0; i < q; ++i)
	{
		string a, b;
		cin >> a >> b;
		cout << lcs(a, b) << endl;
	}
}

int main()
{
	solve();
	return(0);
}