最长公共子序列-jobdu-1402(附带打印)

jobdu-1042：Coincidence

时间限制：1 秒
内存限制：32 兆

题目描述：
Find a longest common subsequence of two strings.

输入：
First and second line of each input case contain two strings of lowercase character a…z. There are no spaces before, inside or after the strings. Lengths of strings

do not exceed 100.

输出：
For each case, output k – the length of a longest common subsequence in one line.

样例输入：
abcd
cxbydz
样例输出：
2
来源：
2008年上海交通大学计算机研究生机试真题
最长公共子序列

 打印：