itertools.combinations_with_replacement(iterable, r) clear solution for Unfair Dice by David_Jones - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

itertools.combinations_with_replacement(iterable, r) solution in Clear category for Unfair Dice by David_Jones

from itertools import combinations_with_replacement, product

def winning_die(enemy_die):
    for your_die in combinations_with_replacement(range(1,18), len(enemy_die)):
        if (
                sum(your_die) == sum(enemy_die)
            and sum((x>y)-(x 0
        ):
            return list(your_die)
    return []

July 5, 2019

Comments:

TheRing on July 18, 2023, 6:33 p.m.
Easy Boolean arithmetic. Very nice!

dan_rue on April 18, 2024, 9:56 p.m.
I have some issues with this solution.. In combinationswithreplacement you take range(1, 18) -> 1 to 17, but max(die) is <= 18. Also, you could optimize that to range(1, min(19, sum(enemydie) - len(enemydie) + 2)

The Game is Worth it!

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.