Tugas · algoritma sedang Python ·
Ways to make change
Count the ways to make amount from coins of the given distinct positive denominations, each usable any number of times. Order doesn't matter (1+2 and 2+1 are the same way). Return the count modulo 1,000,000,007. There is exactly one way to make 0. Up to 60 denominations and amounts up to 30,000.
Tanda tangan
def coin_ways(coins: list[int], amount: int) -> int:Contoh
coin_ways([1, 2, 5], 5) # -> 4
coin_ways([2], 3) # -> 0
coin_ways([10], 10) # -> 1Ditambah 7 pengujian tersembunyi dan 1 pengujian input besar dengan batas waktu; inputnya tidak ditampilkan. Tugas diberikan kepada model dalam bahasa Inggris.
#1Mistral Devstral 2 2512selesai · 11 dari 11 pengujianrespons dalam 906 md · waktu eksekusi 345 md · $0.0003 ✓ coin_ways([1, 2, 5], 5)diharapkan 4 2 md ✓ coin_ways([2], 3)diharapkan 0 <1 md ✓ coin_ways([10], 10)diharapkan 1 <1 md ✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ <1 md✓ 15 md⏱ 322 mdKode
def coin_ways(coins: list[int], amount: int) -> int: MOD = 10**9 + 7 dp = [0] * (amount + 1) dp[0] = 1 for coin in coins: for i in range(coin, amount + 1): dp[i] = (dp[i] + dp[i - coin]) % MOD return dp[amount]#1Qwen3 Coder Nextselesai · 11 dari 11 pengujianrespons dalam 2.8 dtk · waktu eksekusi 352 md · $0.0002 ✓ coin_ways([1, 2, 5], 5)diharapkan 4 <1 md ✓ coin_ways([2], 3)diharapkan 0 <1 md ✓ coin_ways([10], 10)diharapkan 1 2 md ✓ 1 md✓ <1 md✓ 2 md✓ 3 md✓ <1 md✓ <1 md✓ 14 md⏱ 327 mdKode
def coin_ways(coins: list[int], amount: int) -> int: MOD = 1000000007 # dp[i] = number of ways to make amount i dp = [0] * (amount + 1) dp[0] = 1 # One way to make 0: use no coins # For each coin, update dp array for all amounts >= coin for coin in coins: for i in range(coin, amount + 1): dp[i] = (dp[i] + dp[i - coin]) % MOD return dp[amount]#1SpaceXAI Grok Build 0.1selesai · 11 dari 11 pengujianrespons dalam 5.4 dtk · waktu eksekusi 354 md · $0.0022 ✓ coin_ways([1, 2, 5], 5)diharapkan 4 <1 md ✓ coin_ways([2], 3)diharapkan 0 <1 md ✓ coin_ways([10], 10)diharapkan 1 <1 md ✓ <1 md✓ <1 md✓ 1 md✓ <1 md✓ <1 md✓ <1 md✓ 14 md⏱ 334 mdKode
def coin_ways(coins: list[int], amount: int) -> int: MOD = 1000000007 dp = [0] * (amount + 1) dp[0] = 1 for coin in coins: for x in range(coin, amount + 1): dp[x] = (dp[x] + dp[x - coin]) % MOD return dp[amount]#1Anthropic Claude Haiku 5.5selesai · 11 dari 11 pengujianrespons dalam 1.7 dtk · waktu eksekusi 355 md · $0.0002 ✓ coin_ways([1, 2, 5], 5)diharapkan 4 <1 md ✓ coin_ways([2], 3)diharapkan 0 2 md ✓ coin_ways([10], 10)diharapkan 1 <1 md ✓ <1 md✓ <1 md✓ 1 md✓ 1 md✓ 1 md✓ 1 md✓ 15 md⏱ 330 mdKode
def coin_ways(coins: list[int], amount: int) -> int: MOD = 1_000_000_007 if amount < 0: return 0 dp = [0] * (amount + 1) dp[0] = 1 for c in coins: if c <= 0 or c > amount: continue for a in range(c, amount + 1): dp[a] = (dp[a] + dp[a - c]) % MOD return dp[amount] % MOD
Biaya token: $0.0028 · Cara babak dijalankan dan dinilai →