from_and_to_factorial_number_system.py, Python 3

Language: Layout:

"""Convert to and from factoradic number representations.
The factoradic - or factorial number system - is a mixed
radix number system which represents integers as the sum
of multiples of factorials.
It has particular uses in combinatorics, in particular
the numbering of permutations.
"""

from math import factorial
from itertools import count

def to_factoradic(n):
    """Convert an integer to a factoradic number.
    Args:
        n: A non-negative integer to be converted.
    Returns:
        A sequence of integers where the factorial of each zero-based
        index gives a place value, and the item at that index is the
        coefficient by which the place value is to be multiplied. The
        sum of the multiples of the factorial place values is equal to
        the argument, n.  Since the coefficient at any index must be
        less that or equal to the index, the coefficient at index 0
        is always 0.
    Raises:
        ValueError: If n is negative.
        ValueError: If n is not integral.
        ValueError: If n is not finite.
    """
    if n < 0:
        raise ValueError("Negative number {} cannot be represented "
                         "as a factoradic number".format(n))

try:
        v = int(n)
    except OverflowError:
        raise ValueError("Non-finite number {} cannot be represented "
                         "as a factoradic number".format(n))
    else:
        if v != n:
            raise ValueError("Non-integral {} cannot be represented "
                             "as a factoradic number".format(n))

quotient = n
    coefficients = []
    for radix in count(start=1):
        quotient, remainder = divmod(quotient, radix)
        coefficients.append(remainder)
        if quotient == 0:
            break
    return coefficients

def from_factoradic(coefficients):
    """Convert a sequence of factoradic coefficients to an integer.
    Args:
        coefficients: A sequence of integers where the factorial of
            each zero-based index gives a place value, and the item
            at that index is the coefficient by which the place value
            is to be multiplied.
    Returns:
        The integer equivalent of the factoradic representation.
    Raises:
        ValueError: If coefficients does not contain at least
            one element.
        ValueError: If not all elements in coefficients are
            less than or equal to their index values.
    """
    if len(coefficients) < 1:
        raise ValueError("coefficients {!r} does not contain at least one element".format(coefficients))
    if any(coefficient > index for index, coefficient in enumerate(coefficients)):
        raise ValueError("Not all coefficients in {!r} are less than or "
                         "equal to their index values.".format(coefficients))
    return sum(factorial(i)*v for i, v in enumerate(coefficients))
	
x = int(input("Введите натуральное число ввод: _"));
print(str("\n")+str("Было введено: x = "), x);

n = to_factoradic(x);

print(str("\n")+str("Переводим в факториальную систему счисления: n = "), n)

x2 = from_factoradic(n);
print(str("\n")+str("Из факториальной - назад в десятичную:"))
print(str("x2 = "), x2);
print(str("\n")+str("Сравниваем с изначальным: (x == x2)"), (x == x2) );

[ - ] Show input
Absolute running time: 0.12 sec, cpu time: 0.09 sec, memory peak: 6 Mb, absolute service time: 0,13 sec