代码

#include <cstdio>
#include <algorithm>

int d[11];

// incremental_way: ? ms / 429.839 ms
void incremental_way(const int size)
{
    int p[11], tot = 1, i, j, k, l, *pi, *pj, *pe = d+size-1;
    for (i = 0; i < size; i++) d[i] = i+1, tot *= i+1, p[i] = tot;
    // for (pi = d; pi != pe; pi++) printf("%d ", *pi); printf("%d\n", *pe);
    tot = 0;
    while (++tot < p[size-1])
    {
        i = 0;
        while (tot % p[i+1] == 0) i++;
        pj = d;
        for (pi = d; pi <= pe; pi++) {
            if (*pi < i+2) {
                *pi = i+2 - *pi;
                pj = pi;
            } else if (*pi == i+2) {
                std::swap(*pi, *pj);
            }
        }
        // for (pi = d; pi != pe; pi++) printf("%d ", *pi); printf("%d\n", *pe);
    }
}

int main()
{
    // incremental_way(5);
    // incremental_way(9);
    incremental_way(11);
    return 0;
}

评测结果