99 1 s 128 MB

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, ..., ik > of indices of X such that for all j = 1,2,...,k, x_{ij} = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.

The program input is from the std input. Each data set in the input contains two strings, of length not exceeding 1000, representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. Input is terminated by EOF.

For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.

## Sample Input | ## Sample Output |
---|---|

abcfbc abfcab programming contest abcd mnp | 4 2 0 |

EOF 까지 입력을 받을 경우는 다음과 같이 처리하는 것이 좋다.

char a[1000]; char b[1000]; while( scanf("%d %d", &a, &b) == 2 ) { // 처리 코드는 여기에 }

char a[1000]; char b[1000]; while( cin >> a >> b ) { // 처리 코드는 여기에 }