如果您投掷3个，6个骰子，则多达3次？答案是一个置换？您将如何设置一个函数来解决此问题？

Question

def permutations(numberof_sides,sum_of_dice)
    for i in range(numberof_sides):
         for j in range(sum_of_dice):
             x= ???

我在这里正确的轨道吗？

Answer 1

不确定这是否回答了您的问题，但是我们可以使用itertools.permutations来创建排列列表，然后循环循环以查看它们是否正确总结

一个基本示例可能会如下：

from itertools import permutations

# creates repeats of lists, to communicate
# that we have a certain number of dice
def num_list(sides, count):
    modified_list = []
    for i in range(count):
        #appends the same list as many times as is called for
        modified_list += list(range(1, sides + 1))
    return modified_list

# returns sum of elements in list
def sum(list):
    running_sum = 0
    for element in list:
        running_sum += element
    return running_sum

def permutations_basic(num_of_dice, dice_sides, desired_sum):

    # creates a set, to prevent repeats of identical permutations
    output = set()

    # itertools.permutations does most of the heavy lifting here, so
    # we only need to loop through the permutations it generates
    for perm in list(permutations(num_list(dice_sides, num_of_dice), num_of_dice)):

        if sum(perm) == desired_sum:
            output.add(perm)

    return output


# all permutations for 3 D6, that add to 7
for item in permutations_basic(3, 6, 7):
    print(item)

edit：edit：修复了评论中的错字