Go: package main

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

const max int = 1000 + 1
var A [][]int

func lcs(x, y string) int {
	x = " " + x
	y = " " + y
	for i:=0;i<len(x); i++ {
		for j:=0;j<len(y); j++ {
			A[i][j] = 0
		}
	}
	for i:=1; i<len(x); i++ {
		for j:=1; j<len(y); j++ {
			if x[i] == y[j] {
				A[i][j] = A[i-1][j-1] + 1
			} else if A[i-1][j] > A[i][j-1] {
				A[i][j] = A[i-1][j]
			} else {
				A[i][j] = A[i][j-1]
			}
		}
	}
	return A[len(x)-1][len(y)-1]
}

func nextInt(scanner *bufio.Scanner) int {
	scanner.Scan()
	num, _ := strconv.Atoi(scanner.Text())
	return num 
}

func nextStr(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}


func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Split(bufio.ScanWords)
	A = make([][]int, max)
	for i := range A {
		A[i] = make([]int, max)
	}
	n := nextInt(scanner)
	for i:=0; i<n; i++ {
		x := nextStr(scanner)
		y := nextStr(scanner)
		fmt.Printf("%d\n", lcs(x, y))
	}
}

C++: /*
** Longest Common Subsequence
*/

# include <cstdio>
# include <cstring>
# include <algorithm>
using namespace std;

const int MAX = 1000 + 5;

char s1[MAX], s2[MAX];
int c[MAX][MAX];

int lcs() {
    int m = strlen(s1);
    int n = strlen(s2);
    c[0][0] = 0;
    int maxl = 0;
    for (int i = 0; i < m; i++) {
        c[i][0] = 0;
    }
    for (int i = 0; i < n; i++) {
        c[0][i] = 0;
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            if (s1[i] == s2[j]) {
                c[i][j] = c[i - 1][j - 1] + 1;
            }
            else {
                c[i][j] = max(c[i][j - 1], c[i - 1][j]);
            }
            maxl = max(maxl, c[i][j]);
        }
    }

    return maxl;
}

void solve() {
    int n;
    scanf("%d", &n);
    while (n--) {
        scanf("%s %s", s1, s2);
        printf("%d\n", lcs());
    }
}

int main() {
    // freopen("infile", "r", stdin);
    // freopen("outfile", "w", stdout);
    solve();
    return 0;
}

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

int main(void){
    int Q;
    cin >> Q;
    
    for(int q = 0;q < Q;q++){
        string x,y;
        cin >> x >> y;
        
        int dp[x.size()+1][y.size()+1];
        for(int i = 0;i < x.size()+1;i++){
            for(int j = 0;j < y.size()+1;j++){
                dp[i][j] = 0;
            }
        }
        
        for(int i = 0;i < x.size();i++){
            for(int j = 0;j < y.size();j++){
                if(x[i] == y[j]){
                    dp[i+1][j+1] = max(dp[i+1][j+1],dp[i][j]+1);
                }
                dp[i+1][j+1] = max(dp[i+1][j+1],dp[i][j+1]);
                dp[i+1][j+1] = max(dp[i+1][j+1],dp[i+1][j]);
            }
        }
        cout << dp[x.size()][y.size()] << endl;
    }
}

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

#define N 1000

int lcs(string x, string y) {
  int i, j, m, n, lcs[N+1][N+1];
  
  m = x.length();
  n = y.length();
  // indexずれを補正
  x = ' ' + x;
  y = ' ' + y;
  
  // 初期値
  for (i = 0; i < m + 1; i++) lcs[i][0] = 0;
  for (j = 0; j < n + 1; j++) lcs[0][j] = 0;
  // 漸化式
  for (i = 1; i <= m; i++) {
    for (j = 1; j <= n; j++) {
      if (x[i] == y[j]) lcs[i][j] = lcs[i-1][j-1] + 1;
      else lcs[i][j] = max(lcs[i-1][j], lcs[i][j-1]);
    }
  }

  return lcs[m][n];
}

int main() {
  int i, q, lcs_arr[N];
  string x, y;

  cin >> q;

  for (i = 0; i < q; i++) {
    cin >> x;
    cin >> y;
    lcs_arr[i] = lcs(x, y);
  }    

  for (i = 0; i < q; i++) cout << lcs_arr[i] << endl;
    
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <fstream>

#define SMAX 1000
#define QMAX 150

using namespace std;

int main()
{
  int q;
  cin >> q;
  
  char X[SMAX], Y[SMAX];
  int LCS[SMAX+1][SMAX+1] = {0};
  int Anwser[QMAX];
  for(int i = 0; i<q; i++) {
    scanf("%s",X);
    scanf("%s",Y);
    int size_X = strlen(X);
    int size_Y = strlen(Y);
    for(int j = 0; j <= size_X; j++) LCS[j][0] = 0;
    for(int j = 0; j <= size_Y; j++) LCS[0][j] = 0;

    for(int j = 1; j <= size_X; j++) {
      for(int k = 1; k <= size_Y; k++) {
	if(X[j-1] == Y[k-1]) LCS[j][k] = LCS[j-1][k-1] + 1;
	else LCS[j][k] = max(LCS[j-1][k], LCS[j][k-1]);
      }
    }
    Anwser[i] = LCS[size_X][size_Y];
  }

  for(int i = 0; i<q; i++) cout << Anwser[i] << endl;

  return 0;
}

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

static const int N = 100;

int main(){
	int n, p[N + 1], m[N + 1][N + 1];
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> p[i - 1] >> p[i];
	}

	for(int i=1;i<=n;i++) m[i][i] = 0;
	for(int l=2;l<=n;l++){
		for(int i=1;i<=n-l+1;i++){
			int j=i+l-1;
			m[i][j] = (1 << 21);
			for(int k=i;k<=j-1;k++){
				m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j]);
			}
		}
	}

	cout << m[1][n] << 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;
	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 <algorithm>
#include <cstring>
using namespace std;

const int Max = 1005;
int c[Max][Max];

void lcs(string s1, string s2)
{
    //memset(c, 0, sizeof(c));
    for(int i=0; i<=s1.size(); i++)
    {
        c[i][0] = 0;
    }
    for(int i=0; i<=s2.size(); i++)
    {
        c[0][i] = 0;
    }
    s1 = " " + s1;
    s2 = " " + s2;
    for(int i=1; i<=s1.size(); i++)
    {
        for(int j=1; j<=s2.size(); j++)
        {
            if(s1[i]==s2[j]) c[i][j] = c[i-1][j-1]+1;
            else
            {
                c[i][j] = max(c[i][j-1], c[i-1][j]);
            }
        }
    }
}
int main()
{
    int n;
    cin >> n;
    string s1, s2;
    for(int i=0; i<n; i++)
    {
        cin >> s1 >> s2;
        lcs(s1, s2);
        cout << c[s1.size()][s2.size()] << endl;
    }
    return 0;
}

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

string S,T;
int x[10000],y[10000];
int dp[10000][10000];
char U[53]="abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
int MAXN;

int main(){
	int q;
	cin>>q;
	for(int i=0;i<q;i++){
		MAXN=0;
		cin>>S>>T;
		for(int i=0;i<S.size();i++){
			for(int j=0;j<52;j++){
				if(S[i]==U[j]){
					x[i+1]=j;
				}
			}
		}
		for(int i=0;i<T.size();i++){
			for(int j=0;j<52;j++){
				if(T[i]==U[j]){
					y[i+1]=j;
				}
			}
		}
		for(int i=0;i<=T.size();i++){
			for(int j=0;j<=S.size();j++){
				if(i==0 || j==0){
					dp[i][j]=0;
				}
				else if(x[j]==y[i]){
					dp[i][j]=dp[i-1][j-1]+1;
				}
				else{
					dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
				}
			}
		}
		for(int i=0;i<=T.size();i++){
			for(int j=0;j<=S.size();j++){
				MAXN=max(MAXN,dp[i][j]);
			}
		}
		cout<<MAXN<<endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int main(){
  char str1[1000],str2[1000];
  int LCS[1000][1000]={0};
  int length1,length2;
  int n;
  scanf("%d",&n);
  for(int s=1;s<=n;s++){
   while(cin>>str1>>str2){
     length1=strlen(str1);
     length2=strlen(str2);
     for(int i=0;i<=length1-1;i++){
       LCS[i][0]=0;
     }
     for(int j=0;j<=length2-1;j++){
       LCS[0][j]=0;
     }
     for(int i=1;i<=length1;i++){
       for(int j=1;j<=length2;j++){
         if(str1[i-1]==str2[j-1]) {
           LCS[i][j]=LCS[i-1][j-1]+1;
         }
         else LCS[i][j]=max(LCS[i-1][j],LCS[i][j-1]);
       }
     }
     printf("%d\n",LCS[length1][length2]);
   }
 }
   return 0;
}