시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 512 MB | 5 | 2 | 2 | 40.000% |
Clara has two strings $s$ and $t$. She would like to choose two subsequences $x$ from $s$ and $y$ from $t$ such that:
Note that:
The input consists of several test cases terminated by end-of-file. For each test case:
The first line contains a string $s$. The second line contains a string $t$.
For each test case, output the sum of $|x|$ and $|y|$.
aaaa bbbb abcd abca abcd abcd
8 7 8