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

using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int dp[2][1024];

int main() {
  // use scanf in CodeForces!
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N;
  cin >> N;
  REP(q, N) {
    string X, Y;
    cin >> X >> Y;
    int LX = X.size(), LY = Y.size();
    REP(i, 2) REP(j, LY+1) dp[i][j] = 0;
    REP(i, LX) REP(j, LY) {
      if (X[i] == Y[j]) {
	dp[(i+1)%2][j+1] = dp[i%2][j] + 1;
      } else {
	dp[(i+1)%2][j+1] = max(dp[(i+1)%2][j], dp[i%2][j+1]);
      }
    }
    cout << dp[LX%2][LY] << endl;
  }
  return 0;
}

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

int main() {
  int q; cin >> q;
  string A, B;
  for (int i=0; i<q; i++) {
    cin >> A >> B;
    vector<vector<int>> LCS(A.length()+1, vector<int>(B.length()+1,0));
    int ans=0;
    for (int j=1; j<=A.length(); j++) {
      for (int k=1; k<=B.length(); k++) {
        if(A[j]==B[k]) LCS[j][k]=LCS[j-1][k-1]+1;
        else LCS[j][k]=max(LCS[j-1][k],LCS[j][k-1]);
        ans = max(ans, LCS[j][k];
      }
    }
    cout << ans << "\n";
  }
}

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

using namespace std;

const int MAXN = 1010;

int main(int argc, char const *argv[]) {
  int q;
  cin >> q;
  for (auto k = 0; k < q; k++) {
    vector<vector<int>> dp(MAXN, vector<int>(MAXN, 0));
    string s1, s2;
    cin >> s1 >> s2;
    auto n = s1.size();
    auto m = s2.size();
    for (size_t i = 0; i < n; i++) {
      for (size_t j = 0; j < m; j++) {
        if (s1[i] == s2[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]);
        }
      }
    }
    cout << dp[n][m] << endl;
  }

  return 0;
}

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

int lcs(string s, string t) {
  int n = s.size(), m = t.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][j] + (s[i] == t[j]), max(dp[i][j + 1], dp[i + 1][j]));
    }
  return dp[n][m];
}

int main(void){
    int n;cin>>n;
    for(int i=0;i<n;i++){
        string s,t;cin>>s>>t;
        cout<<lcs(s,t)<<endl;
    }
    return 0;
}

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

int count(int (*common)[1001], char *x, char *y, int n1, int n2){
    if(n1*n2==0)return 0;
    else if(common[n1][n2]<0){
        if(x[n1]==y[n2])common[n1][n2] = 1 + count(common,x,y,n1-1,n2-1);
        else common[n1][n2] = std::max(count(common,x,y,n1-1,n2),count(common,x,y,n1,n2-1));
    }
    return common[n1][n2];
}

int main(){
    int i, j, k, q;
    char c;
    char x[1002], y[1002];
    int common[1001][1001];
    scanf("%d",&q);
    for(i=0;i<q;i++){
        scanf("%s",x+1);
        scanf("%s",y+1);
        int n1 = strlen(x+1);
        int n2 = strlen(y+1);
        for(j=1;j<=n1;j++){
            for(k=1;k<=n2;k++){
                common[j][k] = -1;
            }
        }
        printf("%d\n",count(common,x,y,n1,n2));
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

/**
 *  lcs(m,n) = 
 *  if x[m] == y[n] lcs[m-1,n-1]+1
 *  max(lcs[m-1,n],lcs[m,n-1])
 *
 */

string x, y;

int lcs(int m, int n)
{
	if (m == -1 || n== -1) return 0;
	if (x[m] == y[n]) return lcs(m-1,n-1) + 1;
	int xx = lcs(m-1,n);
	int yy = lcs(m,n-1);
	return xx > yy ? xx : yy;
}

int main()
{
	int n = 0;
	x.resize(150);
	y.resize(150);
	cin >> n; 
	for (int i=0;i<n;i++)
	{
		cin >> x;
		cin >> y;
		cout << lcs(x.size()-1, y.size()-1) << endl;
		x.clear();
		y.clear();
	}
}

C++: #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
	int n, m, q, A[1001][1001], i, j;
	string str1, str2;
	cin >> q;

	while (q--)
	{
		cin >> str1 >> str2;
		n = str1.size();
		m = str2.size();
		int maxv = 0;

		for (i = 1; i <= n; i++)A[i][0] = 0;
		for (i = 1; i <= m; i++)A[0][i] = 0;

		for(i=1;i<=n;i++)
			for (j = 1; j <= m; j++)
			{
				if (str1[i-1] == str2[j-1])
					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;
	}
	return 0;
}

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

int lcs( string X , string Y) {
int c[ N + 1 ][ N + 1 ] ; 
int m = X.size() ; 
int n = Y.size() ; 
int max1 = 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]);
       }
       max1 = max(max1, c[i][j] ) ;
     }
   }
 return max1 ;
}

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;
static const int MAX = 1001;
 
void lcs(string X, string Y) {
    int dp[MAX][MAX];  
    int i,j;
 
    int xLength = X.size();
    int yLength = Y.size();
 
 
    // initialize dp[][]
    for (i = 1; i <= xLength; i++)
        dp[i][0] = 0;
    for (i = 1; i <= yLength; i++)
        dp[0][i] = 0;
 
    for (i = 1; i <= xLength; i++){
        for (j = 1; j <= yLength; j++){
            // Because the original string is 0-based , so subtracted from 1
            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]);
            }
        }
    }
 
    // testing code: print out the dp[][]
    // cout << "j";
    // for (j = 1; j <= yLength; j++)
    //  cout << ' ' << j ;
    // cout << endl;
         
 
    // for (i = 1; i <= xLength; i++){
    //  cout << i << '.';
    //  for (j = 1; j <= yLength; j++){
    //      cout << dp[i][j] << ' ';
    //  }
    //  cout << endl;
    // }
 
    cout << dp[xLength][yLength] << endl;
}
 
int main() {
    int n , i;
    string X, Y;
 
    cin >> n;
    for (i = 0 ; i < n; i++ ) {
        cin >> X;
        cin >> Y;
        lcs(X, Y);
    }
 
    return 0;
 
}