Go: package main

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

// define
var (
	sc = bufio.NewScanner(os.Stdin)
)

func bordersInt(in_map [][]int, invalid int) [][]int{
	H, W := len(in_map), len(in_map[0])
	out_map := make([][]int, H+2)
	for h:=0; h<H+2; h++ {
		out_map[h] = make([]int, W+2)
		for w:=0; w<W+2; w++ {
			out_map[h][w] = invalid
		}
	}
	for h:=0; h<H; h++{
		for w:=0; w<W; w++{
			out_map[h+1][w+1] = in_map[h][w] 
		}
	}
	return out_map
}

func bordersString(in_map [][]string, invalid string) [][]string{
	H, W := len(in_map), len(in_map[0])
	out_map := make([][]string, H+2)
	for h:=0; h<H+2; h++ {
		out_map[h] = make([]string, W+2)
		for w:=0; w<W+2; w++ {
			out_map[h][w] = invalid
		}
	}
	for h:=0; h<H; h++{
		for w:=0; w<W; w++{
			out_map[h+1][w+1] = in_map[h][w] 
		}
	}
	return out_map
}

func scanIntLine(len int) []int{
	arr := make([]int, len)
	for i:=0; i<len; i++{
		sc.Scan()
		tmp, err := strconv.Atoi(sc.Text())
		if err == nil{
			arr[i] = tmp
		}
	}
	return arr
}

func scanStringLine(len int) []string{
	arr := make([]string, len)
	for i:=0; i<len; i++{
		sc.Scan()
		arr[i] = sc.Text()
	}
	return arr
}

func scanIntSplit(len int) []int{
	arr := make([]int, len)
	sc.Scan()
	for i, v := range strings.Split(sc.Text(), " "){
		tmp, err := strconv.Atoi(v)
		if err == nil{
			arr[i] = tmp
		}
	}
	return arr
}

func maxInt(args... int) int{
	sort.Ints(args)
	return args[len(args)-1]
}

func f() {
	var S, T string
	fmt.Scan(&S)
	fmt.Scan(&T)
	lenS, lenT := len(S), len(T)
	dp := make([][]int, lenS+1)
	for i:=0; i<lenS+1; i++ {
		dp[i] = make([]int, lenT+1)
	}
	for i:=1; i<lenS+1; i++ {
		for j:=1; j<lenT+1; j++ {
			if S[i-1] == T[j-1] {
				dp[i][j] = maxInt(dp[i-1][j-1]+1, dp[i-1][j], dp[i][j-1])
			} else {
				dp[i][j] = maxInt(dp[i-1][j], dp[i][j-1])
			}
		}
	}
	fmt.Println(dp[lenS][lenT])
}

func main(){
	var n int 
	fmt.Scan(&n)
	for i:=0; i<n; i++ {
		f()
	}
}

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

using namespace std;

const int kMax = 1000 + 10;

char a_str[kMax], b_str[kMax];
int dp[kMax][kMax];

int main() {
    int q;
    scanf("%d", &q);
    while(q --) {
        scanf("%s%s", a_str, b_str);
        int n = strlen(a_str), m = strlen(b_str);
        for(int i = 0;i < n;++ i) {
            for(int j = 0;j < m;++ j) {
                if(a_str[i] == b_str[j]) dp[i][j] = (i && j ? (dp[i-1][j-1] + 1) : 1);
                else dp[i][j] = max(i ? dp[i-1][j] : 0, j ? dp[i][j-1] : 0);
            }
        }
        printf("%d\n", dp[n-1][m-1]);
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int LCS(string &X, string &Y) {
  X = " " + X;
  Y = " " + Y;
  int X_size = X.size(), Y_size = Y.size();
  vector<vector<int>> CS(Y_size, vector<int>(X_size, 0));
  for (int i = 0; i < Y_size; i++) {
    for (int j = 0; j < X_size; j++) {
      if (i == 0 || j == 0) continue;
      else if (X[j] == Y[i]) {
        CS[i][j] = CS[i - 1][j - 1] + 1;
      } else {
        CS[i][j] = max(CS[i][j - 1], CS[i - 1][j]);
      }
    }
  }
  return CS[Y_size - 1][X_size - 1];
}
int main() {
  int q;
  cin >> q;
  string X, Y;
  for (size_t i = 0; i < q; i++) {
    cin >> X >> Y;
    cout << LCS(X, Y) << endl;

    X.clear();
    Y.clear();
  }
}

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

int dp[1005][1005];
int q,n,m;
string x,y;

int main() {
	cin >> q;
	for(int a = 0; a < q; a++){
		cin >> x >> y;
		n = x.size();
		m = y.size();
		for(int i = 0; i < n; i++){
			for(int j = 0; j < m; j++){
			if		(x[i] == y[j]) dp[i+1][j+1] = dp[i][j] + 1;
			else if (x[i] != y[j]) dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j]);
			}
		}
		cout << dp[n][m] << 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=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;

int main(){
        int q;
        cin >> q;
        for(int k = 0; k < q; k++){
                string x, y;
                cin >> x >> y;
                int n = x.size(), m = y.size();
                int l[n + 1][m + 1];
                for(int j = 0; j <= m; j++){
                        for(int i = 0; i <= n; i++){
                                if(i == 0 || j == 0) l[i][j] = 0;
                                else if(x[i - 1] == y[j - 1]) l[i][j] = 1 + l[i - 1][j - 1];
                                else l[i][j] = max(l[i - 1][j], l[i][j - 1]);
                        }
                }
                cout << l[n][m] << endl;
        }
        return 0;
}

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

using namespace std;

int main(void) {
	int noq,nmax,res;
	cin >> noq;
	string t1,t2,X,Y;
	for (int q = 0; q < noq; ++q) {
		cin >> t1 >> t2;
		if (t1.length() < t2.length()) {
			X = t2;
			Y = t1;
		}
		else {
			X = t1;
			Y = t2;
		}
		vector<int> dp(X.length(),0);
		for (int i = 0; i < Y.length(); ++i) {
			nmax = 0;
			for (int j = 0; j < X.length(); ++j) {
				if (Y[i] == X[j]) {
					if (nmax+1 > dp[j]) {
						dp[j] = nmax+1;
					}
					else {
						nmax = max(dp[j],nmax);
					}
				}
				else {
					if (dp[j] < nmax) {
						dp[j] = nmax;
					}
					else {
						nmax = dp[j];
					}
				}
			}
		}
		res = 0;
		for (int i = 0; i < X.length(); ++i) {
			res = max(dp[i],res);
		}
		cout << res << endl;
	}
	return 0;
}