题意:1~n,求怎样做到倒三角形方法加和为输入m的字典序最小的排列
应该是一道dfs,但我不是这么写的,下次用dfs写试试
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n,m;
int a[15],b[15];
int main()
{
while (~scanf ("%d%d",&n,&m)) {
for (int i=0;i<n;i++)
a[i]=i+1;
do {
memcpy(b,a,sizeof(int)*n);
for (int i=n-2;i>=0;i--) {
for (int j=0;j<=i;j++)
b[j]=b[j]+b[j+1];
}
if (b[0]==m) {
printf ("%d",a[0]);
for (int i=1;i<n;i++)
printf (" %d",a[i]);
puts("");
break;
}
} while (next_permutation(a,a+n));
}
return 0;
}