代码

#include <cstdio>
#include <algorithm>

int d[11];

// rotate: 42.204 ms / 416.884 ms
void rotate(const int size)
{
    int tot = 1, i, *ps = d, *pt, *pi, *pe = d+size;
    for (i = 0; i < size; i++) d[i] = i+1, tot *= i+1;
    pi = ps; pt = (ps==d ? d+(size-1) : ps-1); while (pi != pt) { printf("%d ", *pi); if (++pi == pe) pi = d; } printf("%d\n", *pi);
    while (--tot)
    {
        if (*ps == size) {
            i = size - 1;
            pt = ps + 1; if (pt == pe) pt = d;
            while (*pt == i) {
                i--;
                if (++pt == pe) pt = d;
            }
            *ps = *pt;
            while (i < size) {
                if (++ps == pe) ps = d;
                *ps = ++i;
            }
        }
        if (++ps == pe) ps = d;
        pi = ps; pt = (ps==d ? d+(size-1) : ps-1); while (pi != pt) { printf("%d ", *pi); if (++pi == pe) pi = d; } printf("%d\n", *pi);
    }
}

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

评测结果