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 main(){
	buf := make([]byte, 0)
    sc.Buffer(buf, 1000000009)
	var n int 
	fmt.Scan(&n)
	dp := make([][]int, 1003)
	for i:=0; i<1003; i++ {
		dp[i] = make([]int, 1003)
	}
	input_lines := scanStringLine(2*n)
	for i:=0; i<n; i++ {
		S, T := input_lines[2*i], input_lines[2*i+1]
		lenS, lenT := len(S), len(T)
		for i:=1; i<lenS+1; i++ {
			for j:=1; j<lenT+1; j++ {
				if S[i-1] == T[j-1] {
					dp[i][j] = dp[i-1][j-1]+1
				} else if S[i-1] != T[j-1] && dp[i-1][j] > dp[i][j-1] {
					dp[i][j] = dp[i-1][j]
				} else {
					dp[i][j] = dp[i][j-1]
				}
				// 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])
	}
}

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

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

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