#!/usr/local/bin/python3
# Author: Dr. Robert Heckendorn, Computer Science Department, University of Idaho, 2013
from lib import *

# translate from a non-negative integer to a permutation
def translate(x) :
    size = len(x)

    y = list(range(0, size))
    z = array(size, None)

    for i in range(0, size) : 
        k = 0
        for j in range(0, size) : 
            if y[j]!=None :
                if x[i]==k : 
                    z[i] = y[j]
                    y[j] = None
                    break
                k+=1
    return z


# count in the mixed base n factorial
def count(size) :
    x = array(size, 0)
    done = False
    while not done :
        print(translate(x), x)  # translation, number base n!
        for ii in range(0, size) :
            i = size-ii-1
            if x[i]<ii :
                x[i]+=1
                break
            else :
                x[i]=0
                if (i==0) : done = True

count(5)