阅读程序写结果：

1 2#include <iostream>3using namespace std;4const int N = 110;5bool isUse[N];6int n, t;7int a[N], b[N];8bool isSmall() {9    for (int i = 1; i <= n; ++i)10        if (a[i] != b[i]) return a[i] < b[i];11    return false;12}13bool getPermutation(int pos) {14    if (pos > n) {15        return isSmall();16    }17    for (int i = 1; i <= n; ++i) {18        if (!isUse[i]) {19            b[pos] = i; isUse[i] = true;20            if (getPermutation(pos + 1)) {21                return true;22            }23            isUse[i] = false;24        }25    }26    return false;27}28void getNext() {29    for (int i = 1; i <= n; ++i) {30        isUse[i] = false;31    }32    getPermutation(1);33    for (int i = 1; i <= n; ++i) {34        a[i] = b[i];35    }36 37}38int main() {39    scanf("%d%d", &n, &t);40    for (int i = 1; i <= n; ++i) {41        scanf("%d", &a[i]);42    }43    for (int i = 1; i <= t; ++i) {44        getNext();45    }46    for (int i = 1; i <= n; ++i) {47        printf("%d", a[i]);48        if (i == n) putchar(’\n’); else putchar(’ ');49    }50    return 0;51}52 53输入1：6 10 1 6 4 5 3 254输入2：6 200 1 5 3 4 2 6