import math
def jieChen(n):
    myArray = {};
    myArray[0] = 1;
    i = 1;
    while i<n :
        myArray[i] = (i+1)*myArray[i-1];
        i = i+1
    return myArray;
#辗转相除法进行进制转化
def changeInt2Str(i,m):
    if(not isinstance(m,int)):
        print("m is not int",m)
        return
    if(m*i == 0):
        return "0";
    result = "";i
    myarray = {};
    while(i>=m):
        myarray[myarray.__len__()] = i%m
        i=int(i/m)
    if(i!=0):
        myarray[myarray.__len__()] = i
    for item in myarray :
        result=str(myarray[item])+result
    return result
#获取组合数
def getAllArray(m,n):
    allArray = {}
    max = math.pow(m,n)
    index = 0;
    while (index < max):
        itemIndex = changeInt2Str(index,m)
        while(itemIndex.__len__()<n):
            itemIndex = "0"+itemIndex
        allArray[index]=itemIndex
        index = index+1
    print(allArray)
# result = changeInt2Str(14,3);
# print(result)
getAllArray(2,3)