uva code

The Hamming Distance Problem  The Hamming distance between two strings of bits (binary integers) is the number of corresponding bit positions that differ. This can be found by using XOR on co

Problem C Generating Fast, Sorted Permutation Input: Standard Input Output: Standard Output   Generating permutation has always been an important problem in computer science. In this problem