[UVA] 153 - Permalex
Permalex
Given a string of characters, we can permute the individual characters
to make new strings. If we can impose an ordering on the characters
(say alphabetic sequence), then the strings themselves can be ordered
and any given permutation can be given a uni...
