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 <iostream>
#include <string>
using namespace std;

int lcs(string X, string Y) {
	int dp[1000 + 1][1000 + 1];
	int max = 0;
	X = ' ' + X;
	Y = ' ' + Y;
	for (unsigned int i = 1; i <= X.size() - 1; i++)
		dp[i][0] = 0;

	for (unsigned int i = 1; i <= Y.size() - 1; i++)
		dp[0][i] = 0;
	for (unsigned int i = 1; i <= X.size() - 1; i++) {
		for (unsigned int j = 1; j <= Y.size() - 1; j++) {
			if (X[i] == Y[i])
				dp[i][j] = dp[i - 1][j - 1] + 1;
			else if (dp[i - 1][j] >= dp[i][j - 1])
				dp[i][j] = dp[i - 1][j];
			else
				dp[i][j] = dp[i][j - 1];

			max = (max < dp[i][j]) ? dp[i][j] : max;
		}
	}

	return max;
}

int main() {
	int N;
	cin >> N;

	for (int i = 0; i < N; i++) {
		string X, Y;
		cin >> X >> Y;

		cout << lcs(X, Y) << endl;
	}

	return 0;
}

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

int main() {
  int q; cin >> q;
  string A, B;
  for (int i=0; i<q; i++) {
    cin >> A >> B;
    vector<vector<int>> LCS(A.length()+1, vector<int>(B.length()+1,0));
    for (int j=1; j<=A.length(); j++) {
      for (int k=1; k<=B.length(); k++) {
        if(A[j]==B[k]) LCS[j][k]=LCS[j-1][k-1]+1;
        else LCS[j][k]=max(LCS[j-1][k],LCS[j][k-1]);
      }
    }
    cout << LCS[A.length()][B.length()] << "\n";
  }
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1010;
char A[N],B[N];
int dp[N][N];
int main(){
    int n;
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        gets(A+1);  //从下标为1开始读入
        gets(B+1);
    int lenA = strlen(A+1);
    int lenB = strlen(B+1);
    for(int i=0;i<=lenA;i++){
        dp[i][0] = 0;
    }
    for(int i=0;i<lenB;i++){
        dp[0][i] = 0;
    }
    for (int i=1; i<=lenA; i++) {
        for(int j=1;j<=lenB;j++){
            if(A[i] == B[j]){
                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[lenA][lenB]);
}
    return 0;
}

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

int lcs(string s, string t);
int main(){
  int n; cin >> n;
  string s, t;
  int ans[n];
  for(int i=0; i<n; i++){
    cin >> s >> t;
    ans[i]=lcs(s,t);
  }

  for(int i=0; i<n; i++) cout << ans[i] << endl;

  return 0;
}

int lcs(string s, string t){
  int ans=0;
  int sl=s.length(), tl=t.length();
  int dp[sl+1][tl+1];

  for(int i=0; i<=sl; i++) dp[i][0]=0;
  for(int j=0; j<=tl; j++) dp[0][j]=0;

  s=" "+s;
  t=" "+t;
  for(int i=1; i<=sl; i++){
    for(int j=1; j<=tl; j++){
      if(i==0 || j==0) dp[i][j]=0;
      else if(s[i]==t[j]) dp[i][j]=dp[i-1][j-1]+1;
      else dp[i][j]=max(dp[i][j-1], dp[i-1][j]);
    }

  }

  return dp[sl][tl];
}

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

int lcs(string X, string Y) {
  int dp[1000 + 1][1000 + 1];
  int max = 0;
  int m = X.size();
  int n = Y.size();
  X = ' ' + X;
  Y = ' ' + Y;
  for (unsigned int i = 1; i <= m; i++)
    dp[i][0] = 0;

  for (unsigned int i = 1; i <= n; i++)
    dp[0][i] = 0;
  for (unsigned int i = 1; i <= m; i++) {
    for (unsigned int j = 1; j <= n; j++) {
      if (X[i] == Y[i])
	dp[i][j] = dp[i - 1][j - 1] + 1;
      else if (dp[i - 1][j] >= dp[i][j - 1])
	dp[i][j] = dp[i - 1][j];
      else
	dp[i][j] = dp[i][j - 1];

      max = (max < dp[i][j]) ? dp[i][j] : max;
    }
  }

  return max;
}

int main(int argc, char const *argv[]) {
  int N;
  cin >> N;

  for (int i = 0; i < N; i++) {
    string X, Y;
    cin >> X >> Y;

    cout << lcs(X, Y) << 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];
    int m = X.size();
    int n = Y.size();
    int maxl = 0;
    X.insert(0, " ");  // X[0]に空白を挿入
    Y.insert(0, " ");;  // Y[0]に空白を挿入

    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]);
            // if (c[i][j] > maxl) {
            //     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], m=X.size(), n=Y.size(), LMAX=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]);
      }
      LMAX=max(LMAX, c[i][j]);
    }
  }

  return LMAX;
}

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

int main(){
	
	vector<int> v;
	int n=0;
	scanf("%d", &n);
	string a;
	string b;
	for (int i = 0; i < n; ++i)
	{
		char a1[1000],b1[1000];
		string a(a1);
		string b(b1);
		vector<vector<int> > dp(int(a.size()), vector<int>(int(b.size())));
		
		if(a[0]==b[0]) dp[0][0]=1;
		for (int i = 0; i < a.size(); ++i)
		{
			if(a[i]==b[0]){
				dp[i][0]=1;
			} else {
				dp[i][0]=dp[i-1][0];
			}
		}
		for (int i = 0; i < b.size(); ++i)
		{
			if(a[0]==b[i]){
				dp[0][i]=1;
			} else {
				dp[0][i]=dp[0][i-1];
			}
		}
		for (int i = 1; i < a.size(); ++i)
		{
			for (int j = 1; j < b.size(); ++j)
			{
				if(a[i]==b[j]){
					dp[i][j]=dp[i-1][j-1]+1;
				} else {
					dp[i][j]=max(dp[i-1][j-1],max(dp[i-1][j],dp[i][j-1]));
				}
			}
		}
		int na=int(a.size());
		int nb=int(b.size());
		v.push_back(dp[na][nb]);
	}
	for (int i = 0; i < v.size(); ++i)
	{
		printf("%d\n",v[i]);
	}

	return(0);
}

C++: #include <iostream>
#include <cstring>
using namespace std;
int main(void)
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        string str1,str2;
        cin>>str1>>str2;
        int lenth1,lenth2;
        lenth1=(int)str1.length();
        lenth2=(int)str2.length();
        int dp[lenth1+1][lenth2+1];
        for(int j=0;j<=lenth1;j++)dp[j][0]=0;
        for(int j=0;j<=lenth2;j++)dp[0][j]=0;
        for(int j=1;j<=lenth1;j++)
        {
            for(int k=1;k<=lenth2;k++)
            {
                if(str1[j-1]==str2[k-1])
                {
                    dp[j][k]=dp[j-1][k-1]+1;
                }
                else dp[j][k]=max(dp[j-1][k],dp[j][k-1]);
            }
        }
        cout<<dp[lenth1][lenth2]<<endl;
    }
    return 0;
}