project_euler.problem_031.sol1¶

In England the currency is made up of pound, f, and pence, p, and there are eight coins in general circulation:

1p, 2p, 5p, 10p, 20p, 50p, f1 (100p) and f2 (200p). It is possible to make f2 in the following way:

1xf1 + 1x50p + 2x20p + 1x5p + 1x2p + 3x1p How many different ways can f2 be made using any number of coins?

Functions¶

`fifty_pence`(→ int)
`five_pence`(→ int)
`one_pence`(→ int)
`one_pound`(→ int)
`solution`(→ int)	Returns the number of different ways can n pence be made using any number of
`ten_pence`(→ int)
`twenty_pence`(→ int)
`two_pence`(→ int)
`two_pound`(→ int)

project_euler.problem_031.sol1.solution(n: int = 200) → int¶

Returns the number of different ways can n pence be made using any number of coins?

>>> solution(500)
6295434
>>> solution(200)
73682
>>> solution(50)
451
>>> solution(10)
11