UVA – 729 – The Hamming Distance Problem

Problem Link : UVA – 729 – The Hamming Distance Problem

#include <stdio.h>
#include <iostream>
#include <bitset>
using namespace std;

int main() {
	int i, T, L, hamming;
	scanf("%d", &T);
	while (T--) {
		cin >> L >> hamming;
		for (i = 0; i < 1 << L; i++)
			if (__builtin_popcount(i) == hamming)
				cout << bitset<32>(i).to_string().substr(32 - L, L) << endl;
		if (T)
			putchar('\n');
	}
	return 0;
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: