摘要： 一、题目The Hamming Distance ProblemThe 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 corresponding bits or equivalently, by adding corresponding bits (base 2) without a carry. For example, in th 阅读全文

摘要： 一、题目Problem CGenerating Fast, Sorted PermutationInput:Standard InputOutput:Standard OutputGenerating permutation has always been an important problem in computer science. In this problem you will have to generate the permutation of a given string in ascending order.Remember that your algorithm must 阅读全文

摘要： 一、题目ID CodesTime Limit:1000MSMemory Limit:10000KTotal Submissions:4558Accepted:2753DescriptionIt is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to counter a chronic breakdown in law and order, the Gov 阅读全文