The Hamming Distance Problem UVA - 729 (推荐使用 next_permutation())

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
using namespace std;
string s[100];
//char p[10]={'c','b','b','a','a'};
string p;
int test[55];
int main()
{
    int t;
    cin>>t;
    while(t--){
    int n,m;
   // freopen("input.txt","r",stdin);
   memset(test,0,sizeof(test));
   cin>>n>>m;
   for(int i=0;i<m;i++)
    test[n-1-i]=1;
   do{
    for(int i=0;i<n;i++)cout<<test[i];
    cout<<endl;
   }while(next_permutation(test,test+n));
   if(t>0)cout<<endl;
    }
}