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 JavaScript (judge verdict: Accepted)

function getLcs(strX, strY) {
    const sizeX = strX.length;
    const sizeY = strY.length;
    strX = ' ' + strX;
    strY = ' ' + strY;

    const com = [];
    for (let i = 0; i <= sizeX; i++) {
        for (let ji = 0; ji <= sizeY; ji++) {
            if(!com[i]) com[i] = [];
            com[i][ji] = 0;
        }
    }

    for (let i = 1; i <= sizeX; i++) {
        for (let ji = 1; ji <= sizeY; ji++) {

            if (strX[i] === strY[ji]) {
                com[i][ji] = com[i - 1][ji - 1] + 1;
            } else if (com[i - 1][ji] >= com[i][ji - 1]) {
                com[i][ji] = com[i - 1][ji];
            } else {
                com[i][ji] = com[i][ji - 1];
            }
        }
    }
    return com[sizeX][sizeY];
}


function main(_stdin) {
    const stdin = _stdin.split('\n');
    let q = parseInt(stdin.shift(), 10);

    while (q) {
        console.log(getLcs(stdin.shift(), stdin.shift()));
        q--;
    }
}


main(require('fs').readFileSync('/dev/stdin', 'utf8'));