#include <bits/stdc++.h>
using namespace std;
#define maxn 1111
int a[maxn];
int n, m;
int main () {
while (scanf ("%d%d", &n, &m) == 2) {
for (int i = 0; i < n; i++)
a[i] = i+1;
m--;
for (int i = 1; i <= m; i++) {
next_permutation (a, a+n);
}
for (int i = 0; i < n-1; i++)
printf ("%d ", a[i]);
printf ("%d\n", a[n-1]);
}
return 0;
}
HDU 1027 STL
最新推荐文章于 2020-09-20 09:46:38 发布