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<cmath>
#include<vector>
#include<string>

using namespace std;
#define ML 1000

inline int comp_char(char a,char b) { if(a==b) return 1;else return 0;}


int longest_cmmsubseq(string &xcomp,string &ycomp,vector<vector<int>> &memo){
  int ysize=ycomp.size();
  int xsize=xcomp.size();
  int max=0;
  for(int i=0;i<xsize;i++){
    if(ycomp.at(0)==xcomp.at(i)){
      while(i<xsize){ memo.at(i).at(0)=1; i++;}
      continue;
    }
    else memo.at(i).at(0)=0;
  }
  for(int j=0;j<ysize;j++){
    if(ycomp.at(j)==xcomp.at(0)){
      while(j<ysize){ memo.at(0).at(j)=1; j++;}
      continue;
    }
    else memo.at(0).at(j)=0;
  }

  for(int j=1;j<ysize;j++){
    for(int i=1;i<xsize;i++){
      max=memo.at(i-1).at(j-1)+comp_char(xcomp.at(i),ycomp.at(j));
      if(max<memo.at(i-1).at(j)) max=memo.at(i-1).at(j);
      if(max<memo.at(i).at(j-1)) max=memo.at(i).at(j-1);
      memo.at(i).at(j)=max;
      max=0;
    }
  }
  return memo.at(xsize-1).at(ysize-1);
}

int main(void){

  int size;
  cin>>size;

  vector<vector<int>> memo(ML,vector<int>(ML));
  string xcomp,ycomp;
  for(int i=0;i<size;i++){
    cin>>xcomp>>ycomp;
    cout<<longest_cmmsubseq(xcomp,ycomp,memo)<<endl;
  }
}

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

using namespace std;                                         
                                                             
//L[i][j] X[0]..X[i]??¨X[0]..Y[j]???LCS                        
int L[1000][1000]={};                                        
int main(){
  int testnum;
  cin>>testnum;                                              
  for(int t=0;t<testnum;++t){                                
    string X,Y;                                              
    cin>>X>>Y;
    
    for(int i=1;i<=X.length();++i){                          
      for(int j=1;j<=Y.length();++j){                        
        if(X[i-1]==Y[j-1])
          L[i][j] = 1 + L[i-1][j-1];                         
        else
          L[i][j] = max(L[i][j-1],L[i-1][j]);
      }
    }

    cout << L[X.length()][Y.length()] << 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 maxv = 0;
    X = ' ' + X; //X[0]に空白を挿入
    Y = ' ' + Y; //Y[0]に空白を挿入
    for(int i=0;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]);
            }
         maxv = max(maxv,c[i][j]);   
        } 
    }
    return maxv;
}

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;
#define int long long

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n; cin >> n;
  while( n-- ) {
    string s,t; cin >> s >> t;
    int N = max(s.size(),t.size());
    vector< vector<int> > dp(N+1,vector<int>(N+1,0));
    for(int i = 0; i < s.size(); i++){
      for(int j = 0; j < t.size(); j++){
        if(s[i] == t[j]) dp[i+1][j+1] = dp[i][j] + 1;
        else dp[i+1][j+1] = max(dp[i+1][j],dp[i][j+1]);
      }
    }
    cout << dp[s.size()][t.size()] << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
#define fore(i,a,b) for(ll i=(a);i<=(b);++i)
#define rep(i,n) fore(i,0,(n)-1)
#define rfore(i,a,b) for(ll i=(b);i>=(a);--i)
#define rrep(i,n) rfore(i,0,(n)-1)
#define all(x) (x).begin(),(x).end()
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
template<class T>
bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>
bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}

void solve(){
    ll n;cin>>n;
    while(n--){
        string s,t;cin>>s>>t;
        ll l1=s.size(),l2=t.size();
        vvl dp(l1+1,vl(l2+1));
        rep(i,l1)rep(j,l2){
            dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);
            if(s[i]==t[j])dp[i+1][j+1]=dp[i][j]+1;
        }
        cout<<dp[l1][l2]<<endl;
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    solve();
}

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

void fnInput(vector<string>& rvsStrX, vector<string>& rvsStrY)
{
  int nMaxSiz;
  cin >> nMaxSiz;
  rvsStrX.resize(nMaxSiz);
  rvsStrY.resize(nMaxSiz);

  for (int i = 0; i < nMaxSiz; ++i)
  {
    cin >> rvsStrX[i] >> rvsStrY[i];
    rvsStrX[i] = ' ' + rvsStrX[i];
    rvsStrY[i] = ' ' + rvsStrY[i];
  }
}

int fnLngCmnSubseq(const vector<string>& cnrvsStrX, const vector<string>& cnrvsStrY)
{
  vector<vector<int>> vvnLcsDP;
  for (int i = 0; i < cnrvsStrX.size(); ++i)
  {
    const int nMAXNX = cnrvsStrX[i].size();
    const int nMAXNY = cnrvsStrY[i].size();

    vvnLcsDP.clear();
    vvnLcsDP.resize(nMAXNX, vector<int>(nMAXNY, 0));

    for (int nx = 1; nx < nMAXNX; ++nx)
      for (int ny = 1; ny < nMAXNY; ++ny)
        if (cnrvsStrX[i][nx] == cnrvsStrY[i][ny])
          vvnLcsDP[nx][ny] = vvnLcsDP[nx - 1][ny - 1] + 1;
        else
          vvnLcsDP[nx][ny] = max(vvnLcsDP[nx - 1][ny], vvnLcsDP[nx][ny - 1]);

    cout << vvnLcsDP[nMAXNX - 1][nMAXNY - 1] << endl;
  }
}

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  vector<string> vsStrX, vsStrY;

  fnInput(vsStrX, vsStrY);
  fnLngCmnSubseq(vsStrX, vsStrY);
  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=0;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(void){
    int n;
    string str1,str2;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> str1 >> str2;
        cout << lcs(str1,str2) << endl;
    }
    return 0;
}