SP12076 LCS0 - Longest Common Subsequence

No imagination at the moment.

You will be given two lines. The first line will contain the string A, the second line will contain the string B. Both strings consist of no more than 50000 lowercase Latin letters.

Output the length of the longest common subsequence of strings A and B.