Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func lcs(a, b string) int {
	lenA := len(a)
	lenB := len(b)
	dp := make([][]int, lenA+1)
	for i := range dp {
		dp[i] = make([]int, lenB+1)
	}

	for i := 1; i <= lenA; i++ {
		for j := 1; j <= lenB; j++ {
			if a[i-1] == b[j-1] {
				dp[i][j] = dp[i-1][j-1] + 1
			} else {
				dp[i][j] = max(dp[i][j-1], dp[i-1][j])
			}
		}
	}
	return dp[lenA][lenB]
}

func main() {
	n := scanInt()
	w := bufio.NewWriter(os.Stdout)
	for i := 0; i < n; i++ {
		a := scanString()
		b := scanString()
		fmt.Fprintln(w, lcs(a, b))
	}
	w.Flush()
}

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(){
    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 <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#define MAX 150
void solve(void);
int q,count[MAX][MAX]={},xlength,ylength;
char X[MAX],Y[MAX];

void solve(void){
  int i,j;

  for(i=1;i<=strlen(X);i++){
    for(j=1;j<=strlen(Y);j++){
      if(X[i-1]==Y[j-1]) count[i][j]=count[i-1][j-1]+1;
      else if(count[i-1][j]>=count[i][j-1]) count[i][j]=count[i-1][j];
      else count[i][j]=count[i][j-1];
    }
  }

  xlength=strlen(X);
  ylength=strlen(Y);
}
    

int main()
{
  int i;
  
  scanf("%d",&q);

  for(i=1;i<=q;i++){
    scanf("%s",X);
    scanf("%s",Y);
    solve();
    printf("%d\n",count[xlength][ylength]);
  }

  /*for(i=0;i<q;i++){
    printf("%d\n",count[][]);
    }*/

  return 0;
}

C++: #include <bits/stdc++.h>
#include<math.h>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950

void C (string x, string y){
    int p = x.size() ;
    int q = y.size() ;
    vector<vector<int>> dp (p + 1 , vector<int> (q + 1)) ;
    rep(i, p){
        rep(j, q){
            if(x.at(i) == y.at(j)){
                dp[i+1][j+1] = dp[i][j] + 1 ;
            }
            else {
                dp[i+1][j+1] = max(dp[i][j+1], dp[i+1][j]) ;
            }
        }
    }
    cout << dp[p][q] << endl;
}

int main() {
    int n ; 
    cin >> n ;
    vector<string> s (n) ;
    vector<string> t (n);
    rep(i, n){
        cin >> s[i] ;
        cin >> t[i] ;
    }
    rep(k, n){
        C(s[k], t[k])  ;
    }
}

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

int main()
{
  std::vector<std::string> x;
  std::vector<std::string> y;
  std::vector<std::string> z;

  int n;
  std::string str1;
  std::string str2;
  std::string str_z;
  std::cin>>n;
  if(n>150){
   std::cout<<"EEROR\n";
   }
  for(int k=0;k<n;k++){
    std::cin>>str1;
    x.push_back(str1);
    std::cin>>str2;
    y.push_back(str2);
  }
  /*for(int i=0;i<n;i++){
    for(int j=0;j<x[i].size();j++){
      std::cout<<x[i][j]<<":";
      if(j==x[i].size()-1){
	std::cout<<"\n";
      }
    }   
  } 
  for(int i=0;i<n;i++){
    for(int j=0;j<y[i].size();j++){
      std::cout<<y[i][j]<<":";
      if(j==y[i].size()-1){
	std::cout<<"\n";
      }
    }
  }
  std::cout<<x[0].size()<<" "<<y[0].size()<<"\n";
  std::cout<<x[0][2]<<"\n";
  */
  int count[n]={0};
  for(int i=0;i<n;i++){
    int xl=0,yl=0,tmp=0,judege=0;
    if(x[i].size()<=y[i].size()){
      while(judege==0){
	//std::cout<<i<<" xl:"<<xl<<" yl:"<<yl<<"\n";
	if(xl==x[i].size()&&yl==y[i].size()){
	  judege=-1;
	}else if(yl==y[i].size()){
	  yl=tmp;
	  xl++;
	}else if(x[i][xl]==y[i][yl]){
	  count[i]++;
	  str_z=x[i][xl];
	  z.push_back(str_z);
	  xl++;
	  yl++;
	  tmp=yl;
	}else{
	  yl++;
	}
      }
    }else{
     while(judege==0){
	//std::cout<<i<<" xl:"<<xl<<" yl:"<<yl<<"\n";
	if(xl==x[i].size()&&yl==y[i].size()){
	  judege=-1;
	}else if(xl==x[i].size()){
	  xl=tmp;
	  yl++;
	}else if(x[i][xl]==y[i][yl]){
	  count[i]++;
	  str_z=x[i][xl];
	  z.push_back(str_z);
	  xl++;
	  yl++;
	  tmp=xl;
	}else{
	  xl++;
	}
      } 

    }
  }
  for(int i=0;i<n;i++){
    std::cout<<count[i]<<"\n";
    /*for(int j=0;j<z.size();j++){
      std::cout<<z[j];
    } 
    std::cout<<"\n";
    */
  }


  return 0;
}

C++: // Last Change: 12/29/2018 23:21:03.
//
// XとYの先頭に空白を入れることで、探索するべき要素のindexを0~m-1ではなく
// 1~mにしている。これにより、一番最初のcの更新において、i=j=0におけるc[i-1][j-1]
//すなわちc[-1][-1]にアクセスしてしまうことを防いでいる。
//
//***********************************************************************
//下から順番に計算していく方法
//
//***********************************************************************

#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;
using ll = long long;

#define MAXLENGTH 1001

int LCS(string, string);

int LCS(string X, string Y) {
  static int c[MAXLENGTH][MAXLENGTH];
  for (int i = 0; i < MAXLENGTH; i++) {
    c[i][0] = c[0][i] = 0;
  }
  int m, n, maxL;
  m = X.size();
  n = Y.size();
  maxL = 0;
  X = ' ' + X;
  Y = ' ' + Y;
  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() {
  int q;
  cin >> q;
  string X, Y;
  for (int i = 0; i < q; i++) {
    cin >> X >> Y;
    cout << LCS(X, Y) << endl;
  }
}

C++: #include <iostream>
#include <string>
#include <algorithm>
const int MAX_S = 1005;
using namespace std;

int main(void) {
    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        string x, y;
        cin >> x >> y;
        x = ' ' + x;
        y = ' ' + y;

        int dp[MAX_S][MAX_S];
        for (auto j = 1; j < x.size(); j++) {
            dp[j][0] = 0;
        }
        for (auto k = 1; k < y.size(); k++) {
            dp[0][k] = 0;
        }

        int maxlength = 0;
        for (auto j = 1; j < x.size(); j++) {
            for (auto k = 1; k < y.size(); k++) {
                if (x[j] == y[k]) {
                    dp[j][k] = dp[j-1][k-1] + 1;
                } else {
                    dp[j][k] = max(dp[j-1][k], dp[j][k-1]);
                }
                maxlength = max(maxlength, dp[j][k]);
            }
        }

        cout << maxlength << endl;
    }

    return 0;
}

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

using namespace std;

static const int N = 100;

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; // X[0]?????????????????\
  Y = ' ' + Y; // Y[0]?????????????????\
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) {
      if (X[i] == Y[i]) {
        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;
}