Go: package main

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

func main() {
	for q := ReadInt(); q > 0; q-- {
		x, y := ReadString(), ReadString()
		fmt.Println(LCS(x, y))
	}
}

func LCS(x, y string) int {
	dp := make([][]int, len(x)+1)
	for i := 0; i < len(x)+1; i++ {
		dp[i] = make([]int, len(y)+1)
	}
	for i := 0; i < len(x); i++ {
		for j := 0; j < len(y); 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)
			}
		}
	}
	return dp[len(x)][len(y)]
}

func Max(xs ...int) int {
	max := xs[0]
	for _, x := range xs[1:] {
		if max < x {
			max = x
		}
	}
	return max
}

var reader = bufio.NewReader(os.Stdin)

func Scan(a ...interface{}) {
	if _, err := fmt.Fscan(reader, a...); err != nil {
		panic(err)
	}
}
func ReadInt() (i int)       { Scan(&i); return }
func ReadString() (s string) { Scan(&s); return }
func ReadInts(n int) []int {
	v := make([]int, n)
	for i := 0; i < n; i++ {
		Scan(&v[i])
	}
	return v
}

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;
  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<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; //X[0]に空白を挿入
    for(int i = 0; i <= m; i++) c[i][0] = 0;
    for(int j = 0; j <= m; 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 dp[1005][1005]; //d[i][j]:=s1...siとt1...tjのLCSの長さ

int main(){
    int q;
    string X[150], Y[150];

    cin >> q;
    for(int i=0; i<q; i++){
        cin >> X[i];
        cin >> Y[i];
    }

    for(int i=0; i<q; i++){
        for(int j=0; j<1005; j++) for(int k=0; k<1005; k++) dp[j][k] = 0;

        for(int j=0; j<X[i].size(); j++){
            for(int k=0; k<Y[i].size(); k++){
                if(X[i][j] == Y[i][k]) dp[j+1][k+1] = dp[j][k]+1;
                else dp[j+1][k+1] = max(dp[j][k+1], dp[j+1][k]);
            }
        }
        cout << dp[X[i].size()][Y[i].size()] << endl;
    }
}

C++: #include<bits/stdc++.h>
using namespace std;
static const int N=1001;
int lcs(string X,string Y){
  int c[N+1][N+1];
  int m=X.length();
  int n=Y.length();

  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;
}

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 <cstdio>
#include <vector>
using namespace std;

#define MAXX 1024

int min(int a, int b){
	return a > b ? b : a;
}
int max(int a, int b){
	return a < b ? b : a;
}

int LCS(char* a, char* b){
	int al = 0, bl = 0;
	for (int i = 0; i < MAXX; i++){
		if (a[i] == '\0') al = i;
		if (b[i] == '\0') bl = i;
		if (al != 0 && bl != 0) break;
	}
	vector< vector<int> > table(al, vector<int>(bl, 0));
	for (int i = 0; i < al + bl - 1; i++){
		for (int j = max(i - al + 1, 0); j <= min(bl - 1, i); j++){
			if (a[i - j] == b[j]){
				if (i - j == 0 || j == 0){
					table[i - j][j] = 1;
				}
				else{
					table[i - j][j] = table[i - j - 1][j - 1] + 1;
				}
			}
			else{
				if (i - j == 0 && j == 0){
					table[i - j][j] = 0;
				}
				else if (i - j == 0 && j != 0){
					table[i - j][j] = table[i - j][j - 1];
				}
				else if (i - j != 0 && j == 0){
					table[i - j][j] = table[i - j - 1][j];
				}
				else{
					table[i - j][j] = max(table[i - j - 1][j], table[i - j][j - 1]);
				}
			}
		}
	}
	return table[al-1][bl-1];
}

int main(){
	int n, dum;
	scanf("%d", &n);
	char a[MAXX], b[MAXX];
	for (int i = 0; i < n; i++){
		scanf("%s", &a);
		scanf("%s", &b);
		printf("%d\n", LCS(a, b));
	}

	return 0;
}

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

int lcs(string str1, string str2){
  int C[1001][1001];
  int max = 0;

  str1 = ' ' + str1;
  str2 = ' ' + str2;

  for(int i = 1 ; i <= str1.size() ; i++) C[i][0] = 0;
  for(int j = 1 ; j <= str2.size() ; j++) C[0][j] = 0;

  for(int i = 1 ; i <= str1.size() ; i++){
    for(int j = 1 ; j <= str2.size() ; j++){
      if(str1[i] == str2[j]){
	C[i][j] = C[i - 1][j - 1] + 1;
      }else{
	if(C[i - 1][j] > C[i][j -1]) C[i][j] = C[i - 1][j];
	else if(C[i][j -1] > C[i - 1][j]) C[i][j] = C[i][j - 1];
      }

      if(max > C[i][j]) max = max;
      else if(C[i][j] > max) max = C[i][j];

    }
  }

  return max;
}

int main(){
  string str1, str2;
  int n;

  cin >> n;

  for(int i = 0 ; i < n ; i++){
    cin >> str1 >> str2;
    cout << lcs(str1, str2)-1 << endl;
  }

  return 0;
}

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

#define MAX 1000

int lcs(string X, string Y) {
    int c[MAX+1][MAX+1];
    int m = X.size();
    int n = Y.size();
    int i, j;
    int maxlen = 0;
    X = " " + X;
    Y = " " + Y;

    for (i = 1 ; i <= m ; i++ ) c[i][0] = 0;
    for (j = 1 ; j <= n ; j++ ) c[0][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][j-1], c[i-1][j]);
            }
            maxlen = max(maxlen, c[i][j]);
        }
    }
    return maxlen;
}

int main (void) {
    int N, i;
    string x, y;

    cin >> N;

    for(i = 0 ; i < N ; i++) {
        cin >> x;
        cin >> y;
        printf("%d\n", 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 maxl = 0;
    X = ' ' + X;    // X[0]に空白を挿入
    Y = ' ' + Y;    // Y[0]に空白を挿入
    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;
}