PROGRAMMING:Longest common subsequence length

Find the longest common subsequence length of two strings.
###Input format:
Enter two strings of length ≤ 100.
###Output format:
Outputs the longest common subsequence length of two strings.
###Input sample 1:
```in
ABCBDAB
BDCABA
```
###Output sample 1:
```out
four
```
###Input sample 2:
```in
ABACDEF
PGHIK
```
###Output sample 2:
```out
0
```






answer：If there is no answer, please comment