Card Game Gem Affordability and Discount Calculation Functions

Steve is building a board game in which players trade colored gems for cards. Implement the following three functions:

def can_afford(price, gems):
    pass

def purchase_card(price, gems):
    pass

def compute_discount(card_count):
    pass

1. can_afford

• Accept the card's price and the player's colored-gem counts.
• Produce True when the available gems are sufficient; otherwise, produce False.

2. purchase_card

• Accept the card's price and the player's colored-gem counts.
• When the card is affordable, remove the required gems and return the resulting gem counts.

3. compute_discount

• Accept an integer list containing the player's card counts, with one entry for each color.
• Return an integer list containing the discount for every color.

Also explain why the selected data structures are suitable.

Constraints

• There can be as many as 5 colors.
• A card can require at most 10 gems.

Sample Input

price = [1, 1, 1, 0, 2]
gems = [2, 1, 0, 3, 0]
card count = [3, 0, 1, 1, 2]

Sample Output

can_afford: True
updated gems: [1, 0, 0, 3, 0]
discounts: [1, 0, 0, 0, 1]

The affordability result is True because the supplied gems cover the listed price, and the updated counts show the required gems removed. The discount list is the result expected from the supplied card counts.

Example

The following example is also part of the prompt:

Input: 0
1
print('OK')
Output: