[UVA][IDA*] 10073 - Constrained Exchange Sort
Problem D
Constrained
Exchange Sort
Input : standard input
Output : standard output
Given a
permutation of 12 letters 'A'-'L', you are invited to write a program to sort
them in ascending order under the following set of constraints:
...
