mirror of
https://github.com/correl/euler.git
synced 2024-11-23 19:19:53 +00:00
21 lines
591 B
Python
21 lines
591 B
Python
|
# -*- coding: utf-8 -*-
|
||
|
|
"""
|
||
|
|
In England the currency is made up of pound, £, and pence, p, and 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 + 150p + 220p + 15p + 12p + 31p
|
||
|
|
|
||
|
|
How many different ways can £2 be made using any number of coins?
|
||
|
|
"""
|
||
|
|
|
||
|
|
if __name__ == '__main__':
|
||
|
|
coins = [1, 2, 5, 10, 20, 50, 100, 200]
|
||
|
|
coins = [200, 100, 50, 20, 10, 5, 2, 1]
|
||
|
|
combinations = 0
|
||
|
|
for start in range(len(coins)):
|
||
|
|
current = start
|
||
|
|
total = 0
|
||
|
|
break
|