## 1961: Coincidence

[提交][状态][讨论版][数据上传:][下载FPS1元][下载测试数据1元][20kb]

## 题目描述

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.

## 样例输入

google
goodbye

## 样例输出

4

[提交][状态]