Question
counting.py import sys coins = [1,5,10,25] def partitions(n,k): pre 0 0 post return the number of ways k partitions can be formed out of
counting.py
import sys
coins = [1,5,10,25]
def partitions(n,k): """ pre 0
if __name__ == "__main__": # partititions d = len(sys.argv)>3 n = int(sys.argv[1]) k = int(sys.argv[2]) p = partitions(n,k) print("n:",n,"k:",k, "partitions:",p) # make change c = len(coins)-1 a = 10*n+k ways = mkCh(a,c) print("amount:", a, "coins:", coins, "ways:", ways)
This third python programming assignment, PA3, is about counting. You will write two functions partitions (n, k) that counts in how many ways n distinct elements can be grouped into k (non empty) partitions, and nkCh (a, c) that counts in how many ways amount a can be paid with coins 11,5,10,251. Both algorithms are discussed in lecture 15: counting. counting.txt contains some skeleton code. Download it and rename it counting.py. A correct implementation of counting: python3 counting.py 3 2 produces n: 3 k: 2 partitiona: 3 amount: 32 coins: 1, 5, 10, 25) ways: 18 This third python programming assignment, PA3, is about counting. You will write two functions partitions (n, k) that counts in how many ways n distinct elements can be grouped into k (non empty) partitions, and nkCh (a, c) that counts in how many ways amount a can be paid with coins 11,5,10,251. Both algorithms are discussed in lecture 15: counting. counting.txt contains some skeleton code. Download it and rename it counting.py. A correct implementation of counting: python3 counting.py 3 2 produces n: 3 k: 2 partitiona: 3 amount: 32 coins: 1, 5, 10, 25) ways: 18
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started