Go: package main

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

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Scan()
	num, _ := strconv.Atoi(sc.Text())
	for i := 0; i < num; i++ {
		sc.Scan()
		in1 := sc.Text()
		sc.Scan()
		in2 := sc.Text()
		countMax(in1, in2)
	}
}

func countMax(in1 string, in2 string) {
	counta := make([][]int, len(in2)+1)
	for i := 0; i < len(in2)+1; i++ {
		for j := 0; j < len(in1)+1; j++ {
			counta[i] = append(counta[i], 0)
		}
	}

	// fmt.Println(counta)
	for a1, v1 := range in1 {
		i1 := a1 + 1
		for a2, v2 := range in2 {
			i2 := a2 + 1
			// fmt.Printf("1:%v 2:%v\n", i1, i2)
			if v1 == v2 {
				counta[i2][i1] = counta[i2-1][i1-1] + 1
				continue
			}
			val := counta[i2-1][i1]
			if val < counta[i2][i1-1] {
				val = counta[i2][i1-1]
			}

			counta[i2][i1] = val
		}
	}
	fmt.Println(counta[len(in2)][len(in1)])
}

C++: #include <bits/stdc++.h>
using namespace std;
#define For(I,A,B) for(int I=(A); I < (B); ++I)
int c[1005][1005];
int main()
{
int t;
string p;
cin>>t;
getline(cin,p);
while(t--){

int x,y,z,k=0,l,i,j;
string a,b,q,r;

 For(i,0,1005)
 For(j,0,1005)
 c[i][j]=0;

 getline(cin,a);
 getline(cin,b);
 x=a.length();
 y=b.length();
 j=1;
  For(i,0,x) q[j++]=a[i];
  j=1;
  For(i,0,y) r[j++]=b[i];
 For(i,1,x+1)
 For(j,1,y+1)
 {
     if(q[i]==r[j]) c[i][j]=c[i-1][j-1]+1;
     else  c[i][j]=max(c[i-1][j],c[i][j-1]);
 }
    cout<<c[x][y]<<endl;

}

    return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>

int dp[150+1][150+1];

int lcsSub(std::string X, std::string Y, int i, int j){
	if (i==-1 || j==-1){
		return 0;
	}
	else{
		if(X[i]==Y[j]){
			if (dp[i][j] < 0){
				dp[i][j] = lcsSub(X, Y, i-1, j-1);
			}
			return dp[i][j]+1;
		}
		else{
			int up, left;
			if (dp[i+1][j] < 0){
				dp[i+1][j] = lcsSub(X, Y, i, j-1);
			}
			left = dp[i+1][j];
			if (dp[i][j+1] < 0){
				dp[i][j+1] = lcsSub(X, Y, i-1, j);
			}
			up = dp[i][j+1];
			
			return std::max(up, left);
		}
	}
}

int lcs(std::string X, std::string Y){
	int m,n,i,j;
	m = X.length();
	n = Y.length();
	for(i=0;i<m+1;i++){
		for(j=0;j<n+1;j++){
			dp[i][j] = -1;
		}
	}
	return lcsSub(X, Y, m-1, n-1);
}
int main(void){
	int i,q,n,m;
	std::string str1, str2;
	std::cin >> q;
	for (i=0;i<q;i++){
		std::cin >> str1;
		std::cin >> str2;
		std::cout << lcs(str1, str2) << std::endl;
	}
	return 0;
}

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

int main() {
	int setN;
	cin >> setN;
	string A,B;

	for (int i=0;i<setN;i++) {
		cin >> A;
		cin >> B;
		int L[2000][2000] ={};

		for(int j=1;j<A.length()+1;j++) {
			for(int l=1;l<B.length()+1;l++) {
				if(A[j-1] == B[l-1]) {
					L[j][l] = 1+L[j-1][l-1];

				} else {
					L[j][l] = max(L[j-1][l],L[j][l-1]);
				}
				
			}
		}
		/*
		for(int j=0;j<A.length()+1;j++) {
			cout << endl;
			for(int l=0;l<B.length()+1;l++) {
				cout << L[j][l] << " ";
				
			}
		}
		*/

		cout << L[A.length()][B.length()] << endl;


	}
}

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

int lcs(string str1, string str2) {
	int n1 = str1.size();
	int n2 = str2.size();
	int A[n1 + 1][n2 + 1];
	for (int i = 0; i < n1; i++) A[i][0] = 0;
	for (int j = 0; j < n1; j++) A[0][j] = 0;

	for (int i = 1; i <= n1; i++) {
		for (int j = 1; j <= n2; j++) { 
			if (str1[i - 1] == str2[j - 1]) {
				A[i][j] = A[i - 1][j - 1] + 1; //?????´??????+1????????¨???????????¨???????????\??????i-1, j-1????????´??°???i,j?????????????????????+1????????¨???????????¨i-1,j??¨?????§?????????????????¶??????
			} else {
				A[i][j] = max(A[i - 1][j], A[i][j - 1]); //?????´?????????????????§i,j??????????????? i-1,j??¨i,j-1
			}
		}
	}
	return A[n1][n2];
}

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

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

static const int N = 1000;

int lcs(string X,string Y){
    int c[N+1][N+1];    //c[i][k]???Xi??¨Yk???LCS??¨??????????????????
    int m = X.size();
    int n = Y.size();
    int maxl = 0;
    X = ' ' + X; // X[0]?????????????????\
    Y = ' ' + Y;
    for(int i=1;i<=m;i++) c[i][0] = 0;
    for(int k=1;k<=n;k++) c[0][k] = 0;
    c[0][0] = 0;

    for(int i=1;i<=m;i++){
        for(int k=1;k<=n;k++){
            if(X[i]==Y[k]){
                c[i][k] = c[i-1][k-1] + 1;
            } else {
                c[i][k] = max(c[i-1][k],c[i][k-1]);
            }
            maxl = max(maxl,c[i][k]);
        }
    }

    return maxl;
}

int main(){
    
}

C++: #include <iostream>
#include <fstream>
#include <stdio.h>
#include <algorithm>
#include <string>

#define MAX 10000

using namespace std;

int n;
int LCS[MAX][MAX];

void solve(string a, string b){
    int m = a.size();
    int n = b.size();
    int maxl = 0;
    for(int i=0; i<m; i++){
        for(int j=0; j<n; j++){
            LCS[i][j] = 0;
        }
    }
    bool tmp_ok = false;
    for(int i=0; i<n; i++){
        if(a[0] == b[i] || tmp_ok){
            LCS[i][0] = 1;
            maxl = 1;
            tmp_ok = true;
        }
    }
    tmp_ok = false;
    for(int i=0; i<m; i++){
        if(a[i] == b[0] || tmp_ok){
            LCS[0][i] = 1;
            maxl = 1;
            tmp_ok = true;
        }
    }
    for(int i=1; i<n; i++){
        for(int j=1; j<m; j++){
            if(a[j] == b[i]){
                LCS[i][j] = LCS[i-1][j-1]+1;
            }
            else if(LCS[i-1][j]>=LCS[i][j-1]){
                LCS[i][j] = LCS[i-1][j];
            }
            else LCS[i][j] = LCS[i][j-1];
            maxl = max(maxl, LCS[i][j]);
        }
    }
    
    cout << maxl << endl;
}

int main(int argc, const char * argv[]) {
    // input from txt
    
    /////////
    //write//
    /////////
    
    cin >> n;
    for(int i=0; i<n; i++){
        string str_a;
        string str_b;
        cin >> str_a >> str_b;
        solve(str_a, str_b);
    }
    
    return 0;
}

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

int main(){
  int n;
  char x[1000],y[1000];
  int dp[1001][1001];
  //load n;
  cin >>n;
  for(int i=0;i<n;i++){
    scanf("%s",x);
    scanf("%s",y);
    for(int j=0;j<strlen(x);j++){
      for(int k=0;k<strlen(y);k++){
	if(x[j]==y[k]){
	  dp[j+1][k+1]=dp[j][k]+1;
	}

	else{
	  if(dp[j][k+1]>dp[j+1][k]){
	    dp[j+1][k+1]=dp[j][k+1];
	  }

	  else{
	    dp[j+1][k+1]=dp[j+1][k+1];
	  }


	}
      }
    }

  }
  cout <<dp[strlen(x)][strlen(y)]<<endl;

  return 0;
}

C++: #include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n, xl, yl, dp[1003][1003]; char x[1003], y[1003];
int main() {
	scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		scanf("%s", x); xl = strlen(x);
		scanf("%s", y); yl = strlen(y);
		memset(dp, 0, sizeof(dp));
		for(int i = 1; i <= xl; i++) {
			for(int j = 1; j <= yl; j++) {
				if(x[i - 1] == y[i - 1]) dp[i][j] = dp[i - 1][j - 1] + 1;
				else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
			}
		}
		printf("%d\n", dp[xl][yl]);
	}
}

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

int lengthOfLcs_r(const char x[], const char y[], int ix, int iy, int xsize, int ysize) {
	if (ix == xsize || iy == ysize) {
		return 0;
	}
	if (x[ix] == y[iy]) {
		return lengthOfLcs_r(x, y, ix + 1, iy + 1, xsize, ysize) + 1;
	}
	return max(lengthOfLcs_r(x, y, ix, iy + 1, xsize, ysize), lengthOfLcs_r(x, y, ix + 1, iy, xsize, ysize));
}

int lengthOfLcs(string x, string y) {
	return lengthOfLcs_r(x.c_str(), y.c_str(), 0, 0, x.length(), y.length());
}

int main() {
	int q;
	string x, y;

	cin >> q;
	for (int i = 0; i < q; ++i) {
		cin >> x >> y;
		cout << lengthOfLcs(x, y) << endl;
	}
	return 0;
}