UVa 729 - The Hamming Distance Problem

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX = 16+4;
int A[MAX];

int main ()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
int T;
scanf("%d", &T);
while(T--) {
int N, H;
scanf("%d%d", &N, &H);
int i;
for(i=0; i<N-H; i++) A[i] = 0;
for(;i<N; i++) A[i] = 1;
do{
for(i=0; i<N; i++) printf("%d",A[i]);
printf("\n");
}while(next_permutation(A, A+N));
if(T>0) printf("\n");
}
return 0;
}