UVA - 729 The Hamming Distance Problem (全排列)
2014-08-10 19:46
363 查看
The Hamming Distance Problem |
example, in the two bit strings that follow:
A 0 1 0 0 1 0 1 0 0 0 B 1 1 0 1 0 1 0 1 0 0 A XOR B = 1 0 0 1 1 1 1 1 0 0
The Hamming distance (H) between these 10-bit strings is 6, the number of 1's in the XOR string.
Input
Input consists of several datasets. The first line of the input contains the number of datasets, and it's followed by a blank line. Each dataset containsN, the length of the bit strings and H, the Hamming distance, on the same line. There is a blank line between test cases.
Output
For each dataset print a list of all possible bit strings of length N that are Hamming distanceH from the bit string containing all 0's (origin). That is, all bit strings of length
N with exactly H1's printed in ascending lexicographical order.
The number of such bit strings is equal to the combinatorial symbol C(N,H). This is the number of possible combinations of
N-H zeros and H ones. It is equal to
This number can be very large. The program should work for
.
Print a blank line between datasets.
Sample Input
1 4 2
Sample Output
0011 0101 0110 1001 1010 1100
解析:给出两个数,一个是总位数,另一个是1的位数,求全排列
#include <iostream> #include <algorithm> #include <string.h> using namespace std; int main() { int t; int n,h; while(cin >> t) { while( t-- ) { cin >> n >> h; int a[30]; memset(a,0,sizeof(a)); for(int i = 0; i < n-h; i++) { a[i] = 0; } for(int i = n - h; i < n; i++) { a[i] = 1; } do { for(int i = 0; i < n; i++) { cout << a[i]; } cout << endl; } while( next_permutation(a,a+n)); if(t) { cout<<endl; } } } return 0; }
相关文章推荐
- UVa729 The Hamming Distance Problem
- uva 729 - The Hamming Distance Problem(全排列)
- The Hamming Distance Problem UVA729
- UVa 729 The Hamming Distance Problem (全排列输出&小细节)
- UVa 729 - The Hamming Distance Problem 排列组合
- uva-729 - The Hamming Distance Problem-全排列
- UVA 729 - The Hamming Distance Problem
- uva 729 - The Hamming Distance Problem 枚举排列
- UVA 729 - The Hamming Distance Problem 解题报告
- UVa729 - The Hamming Distance Problem(全排列)
- UVa 729 - The Hamming Distance Problem
- UVA - 729 The Hamming Distance Problem
- uva 729 - The Hamming Distance Problem
- uva 729 The Hamming Distance Problem
- UVa729 The Hamming Distance Problem
- uva729 - The Hamming Distance Problem(Hamming距离问题)
- uva 729 The Hamming Distance Problem
- UVA 729 The Hamming Distance Problem
- UVa 729 The Hamming Distance Problem【枚举排列】
- UVA 729 The Hamming Distance Problem