Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Longest Common Subsequence

For given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \{a,b,c,b,d,a,b\}$ and $Y = \{b,d,c,a,b,a\}$, the sequence $\{b,c,a\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\{b,c,a\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\{b,c,b,a\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\{b,c,b,a\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.

Write a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.

Input

The input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.

Output

For each dataset, print the length of LCS of $X$ and $Y$ in a line.

Constraints

$1 \leq q \leq 150$

$1 \leq$ length of $X$ and $Y$ $\leq 1,000$

$q \leq 20$ if the dataset includes a sequence whose length is more than 100

Sample Input 1

3
abcbdab
bdcaba
abc
abc
abc
bc

Sample Output 1

4
3
2

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

Solution in Ruby (judge verdict: Time Limit Exceeded)

# encoding: utf-8                                                                                                                                                                

def solve(str1, str2)
  arr1 = str1.split(//)
  arr2 = str2.split(//)
  sz1 = str1.length  
  sz2 = str2.length
  res = []
  (0..sz1).each do |i|
    res << Array.new(sz2 + 1, 0)
  end

  (1..sz1).each do |i|
    (1..sz2).each do |j|
      if arr1[i - 1] == arr2[j - 1]
        res[i][j] = res[i - 1][j - 1] + 1
      else
        res[i][j] = [res[i - 1][j], res[i][j - 1]].max
      end
    end
  end
  res[sz1][sz2]
end

def main
  t = gets.chomp.to_i
  (1..t).each do |ca|
    str1 = gets.chomp
    str2 = gets.chomp
    puts solve(str1, str2)
  end
end

main