Project_Euler/src/pe31.py at master · VictorCannestro/Project_Euler · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
# -*- coding: utf-8 -*-
"""
# Coin Sums
# Problem 31
#
# In the United Kingdom the currency is made up of pound (£) and pence (p).
# There are eight coins in general circulation:
#
#    1p, 2p, 5p, 10p, 20p, 50p, £1 (100p), and £2 (200p).
#
# It is possible to make £2 in the following way:
#
#    1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
#
# How many different ways can £2 be made using any number of coins?
#
# Notes:
#       (1) This is a good candidate for Dynamic Programming
#
@author: Victor Cannestro
"""

def currencyCombos(targetAmount : int):
    '''
    Parameters
    ----------
    targetAmount : int
        DESCRIPTION.

    Returns
    -------
    int
        DESCRIPTION.
    '''
    #COINS = (1,2,5,10,20,50,100,200)
    #combos = 0

    pass #return len(combos)


if __name__ == "__main__":
    pass