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

#include <string.h>

using namespace std;

typedef long long ll;

template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const int MAX_S = 1000;

int solve(int (*dp)[MAX_S + 1][MAX_S + 1],
        const char *x, const int xlen, const char *y, const int ylen) {
    for (int i = 1; i <= ylen; i++) {
        for (int j = 1; j <= xlen; j++) {
            chmax((*dp)[i][j], (*dp)[i - 1][j]);
            chmax((*dp)[i][j], (*dp)[i][j - 1]);
            if (y[i - 1] == x[j - 1]) {
                chmax((*dp)[i][j], (*dp)[i - 1][j - 1] + 1);
            }
        }
    }
    return (*dp)[ylen][xlen];
}

int main(void) {
    int Q;
    char X[1010], Y[1010];
    cin >> Q;

    for (int i = 0; i < Q; i++) {
        int xlen, ylen;
        int dp[MAX_S + 1][MAX_S + 1];

        cin >> X >> Y;
        xlen = strlen(X);
        ylen = strlen(Y);
        reverse((char *) &X, X + xlen);
        reverse((char *) &Y, Y + ylen);

        for (int i = 0; i <= ylen; i++) {
            for (int j = 0; j <= xlen; j++) {
                dp[i][j] = 0;
            }
        }

        cout << solve(&dp, X, xlen, Y, ylen) << endl;
    }
    
    return 0;
}

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

int main()
{
  int n;
  cin >> n;
  for (int k = 0; k < n; k++)
  {
    string X, Y;
    cin >> X >> Y;
    int N = X.size(), M = Y.size();
    vector<vector<int>> dp(N + 1, vector<int>(M + 1, 0));
    for (int i = 0; i < N; i++)
    {
      for (int j = 0; j < M; j++)
      {
        dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);
        if (X[i] == Y[j])
        {
          dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + 1);
        }
      }
    }
    cout << dp[N][M] << endl;
  }
}

C++: #include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#define xs 1000+5
#define ys 1000+5
using namespace std;
int l[xs][ys];
void lcs(string a,string b){
	int a_size=a.size();int b_size=b.size();
	a=' '+a;b=' '+b;
	for(int i=0;i<=a.size();i++){
		l[i][0]=0;
	}
	for(int i=0;i<=b.size();i++){
		l[0][i]=0;
	}
	for(int i=1;i<=a.size();i++){
		for(int j=1;j<=b.size();j++){
			if(a[i]==b[j]) {
				l[i][j]=l[i-1][j-1]+1;
			}else{
				l[i][j]=max(l[i-1][j],l[i][j-1]);
			}
		}
	}
}
int main(){
	int num;
	scanf("%d",&num);string a,b;
	for (int i=0;i<num;i++){
		
		cin>>a>>b;
		lcs(a,b);
		cout<<l[a.size()][b.size()]<<'\n';
	}
	
}

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

string s, t;
int dp[1000][1000];

void solve() {
    cin >> s >> t;
    for (int i = 0; i < s.size(); i++) {
        for (int j = 0; j < t.size(); j++) {
            dp[i][j] = (i < 1 || j < 1 ? 0 : dp[i-1][j-1]) + (s[i] == t[j] ? 1 : 0);
            int a = (i < 1 ? 0 : dp[i-1][j]);
            int b = (j < 1 ? 0 : dp[i][j-1]);
            dp[i][j] = max(dp[i][j], max(a, b));
        }
    }

    cout << dp[s.size()-1][t.size()-1] << endl;
}

int main() {
    int n;
    cin >> n;
    while (n--) solve();

    return 0;
}

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

int main(){
	int q;
	scanf(" %d", &q);
	for(int i=0; i<q; ++i){
		string x, y;
		cin >> x >> y;
		
		int c[1001][1001];
		int m=x.size(), n=y.size();
		
		for(int i=0; i<=m; ++i) c[i][0]=0;
		for(int i=0; i<=n; ++i) c[0][n]=0;
		
		for(int i=1; i<=m; ++i){
			for(int j=1; j<=m; ++j){
				if(x[i]==y[j]) c[i][j]=c[i-1][j-1]+1;
				else c[i][j]=max(c[i][j-1], c[i-1][j]);		
			}
		}
		
		printf("%d\n", c[m][n]);
	}
}

C++: #include<stdio.h>
#include<string>
#include<algorithm>
using namespase 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<iostream>
#include<string>

using namespace std;

int main(){
  string X, Y;
  int q;
  cin >> q;
  int ans[q];
  for(int i=0;i<q;i++){
    cin >> X;
    cin >> Y;
    int n = X.size();
    int m = Y.size();
    int dp[n+1][m+1];
    for(int j=0;j<n+1;j++){
      dp[j][0] = 0;
    }
    for(int j=0;j<m+1;j++){
      dp[0][j] = 0;
    }
    for(int j=1;j<n+1;j++){
      for(int k=1;k<m+1;k++){	
	if(X[j-1] == Y[k-1]){
	  dp[j][k] = dp[j-1][k-1]+1;
	}else{
	  dp[j][k] = max(dp[j][k-1], dp[j-1][k]);
	}   
       
      }

    }
    ans[i] = dp[n][m];
  }

  for(int i=0;i<q;i++){
    cout << ans[i] << endl;
  }
}

C++: #include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <string>
#include <functional>
#include <numeric>
#include <ctype.h>
#include <cstdlib>
#include <string.h>
#include <cmath>
#include <cstdio>
#include <map>
#include <queue>
#include <utility>
#define rep(i, n) for(int i = 0; i < n; i++);

using namespace std;

const int INF = 1000000007;
const double PI = acos(-1.0);
typedef long long llong;

const int N = 10000;
int c[1000 + 1][1000 + 1];

int search(string X, string Y)
{
	
	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 input1, input2;
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> input1 >> input2;
		cout << search(input1, input2) << endl;
	}

	return 0;
	

}