[UVA][dp] 11081 - Strings
Problem H
Strings
Input: Standard Input
Output: Standard Output
Given 3 strings of only lowercase
letter you have to count the number of ways you can construct the third string
by combining two subsequences from the first two strings.
...
