Uva 729 - The Hamming Distance Problem

 The Hamming Distance Problem 

题目链接：

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=107&page=show_problem&problem=670

今天做的这三题都差不多，还是位运算的问题呵！

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{

    int T = 0, list[20];
    cin>>T;
    for(int k=1; k<=T; ++k)
    {
        int n, h;
        cin>>n>>h;
        for(int i=0; i<(1<<n); ++i)
        {
            int num = 0;
            int cnt = 0;
            for(int j=0; j<n; ++j)
            if(i&(1<<j)) num++;
            if(num == h)
            {
                int temp = i;
                int list[20];
                memset(list, 0, sizeof(list));
                for(int t=1; t<=n; ++t)
                {
                    list[t-1] = temp%2;
                    temp = temp/2;
                }
                for(int t=n; t>=1; --t)
                    cout<<list[t-1];
                cout<<endl;
            }
        }
        if(k != T) cout<<endl;
    }
    return 0;
}