C / C++ / MFC

GetDlgItem(IDC_LIST1)->ShowWindow(SW_HIDE);
GetDlgItem(IDC_EDIT1)->ShowWindow(SW_SHOW);

#include <stdio.h>
void main()
{
	char  hash[] = "df310c24eb35eee2af4f83bed8bee284";
	char * p = hash;
	const unsigned int SIZE = (sizeof(hash)-1)/2;
	unsigned char arr[SIZE];
	unsigned int count=0;
	while (count < SIZE)
	{
		if (sscanf(p, "%2x", &arr[count]) != 1)
		{
			// handle error
		}
		count++;
		p+=2;
	}
}

#include <iostream>
using namespace std;
void main()
{
	unsigned int k = 731;
	unsigned int b;
	const int SIZE = sizeof(k) << 3;
	const unsigned int MSB = 1 << (SIZE-1);
	for (b=0; b<SIZE; b++)
	{
		cout << (( MSB & k) ? 1 : 0);
		k <<= 1;
	}
	cout << endl;
}

#include <iostream>
using namespace std;
void main()
{
	unsigned int k = 731;
	unsigned int b;
	const int SIZE = sizeof(k) << 3;
	const unsigned int MSB = 1 << (SIZE-1);
	bool isLeadZero= true;
	for (b=0; b<SIZE; b++)
	{
		if ( MSB & k)
		{
			isLeadZero = false;
			cout << 1;
		}
		else
		{
			if ( ! isLeadZero) cout << 0;
		}
		
		k <<= 1;
	}
	cout << endl;
}

1. Test the most significative bit of the number.
2. miltiply the number by two, so that the most significative bit is replaced by its adjacent one (the next you'll test).

const int SIZE = sizeof(k) << 3;