[UVA][Trie] 10745 - Dominant Strings
Problem F
Dominant Strings
Input: standard input
Output: standard output
Time Limit: 2 seconds
Given
two strings s1 and s2, we say that s1
dominates s2 if the (multi)set of characters in s1
is a proper superset of the (multi)set of characters in s2.
For ins...
