Longest Common Subsequence
Given two sequences of characters, print the length of the longest common subsequence of both sequences.
For example, the longest common subsequence of the sequences “
The input consists of pairs of lines. The first line of a pair contains the first string, and the second line contains the second string. Each string is on a separate line and consists of at most 1000 characters.
For each subsequent pair of input lines, output a line containing one integer number satisfying the criterion stated above.
Output for Sample Input
|University of Debrecen; Faculty of Informatics; v. 03/01/2019|