uvaoj 729 The Hamming Distance Problem
2014-05-22 15:30
260 查看
同样是生成下一个排列,next_permutation(p,p+n)。
因为不想用for循环输出整数,所以一次%S全部输出,居然还WA了几次,该为for循环输出就AC了,表示不懂啊。
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>
using namespace std;
int a[20];
int main()
{
int N,H,T,i;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&N,&H);
for(i=0;i<N;i++)
if(i<N-H) a[i]=0;
else 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;
}
因为不想用for循环输出整数,所以一次%S全部输出,居然还WA了几次,该为for循环输出就AC了,表示不懂啊。
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>
using namespace std;
int a[20];
int main()
{
int N,H,T,i;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&N,&H);
for(i=0;i<N;i++)
if(i<N-H) a[i]=0;
else 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;
}
相关文章推荐
- UvaOJ 729 The Hamming Distance Problem
- UVaOJ 729 - The Hamming Distance Problem
- 729 - The Hamming Distance Problem
- 729 - The Hamming Distance Problem
- UVA 729 - The Hamming Distance Problem
- UVa 729 The Hamming Distance Problem (全排列输出&小细节)
- uva 729 - The Hamming Distance Problem
- UVa729 The Hamming Distance Problem
- UVa 729 - The Hamming Distance Problem
- 729 - The Hamming Distance Problem(可重集排列,直接枚举)
- 729 - The Hamming Distance Problem
- UVa 729 - The Hamming Distance Problem
- UVa 729 The Hamming Distance Problem【枚举排列】
- uva 729 The Hamming Distance Problem
- UVA - 729 The Hamming Distance Problem
- UVa 729 - The Hamming Distance Problem
- UVa-729-The Hamming Distance Problem
- uva 729 - The Hamming Distance Problem
- uva729 - The Hamming Distance Problem(Hamming距离问题)
- UVA - 729 The Hamming Distance Problem