project_euler.problem_031.sol1
==============================

.. py:module:: project_euler.problem_031.sol1

.. autoapi-nested-parse::

   Coin sums
   Problem 31: https://projecteuler.net/problem=31

   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
---------

.. autoapisummary::

   project_euler.problem_031.sol1.fifty_pence
   project_euler.problem_031.sol1.five_pence
   project_euler.problem_031.sol1.one_pence
   project_euler.problem_031.sol1.one_pound
   project_euler.problem_031.sol1.solution
   project_euler.problem_031.sol1.ten_pence
   project_euler.problem_031.sol1.twenty_pence
   project_euler.problem_031.sol1.two_pence
   project_euler.problem_031.sol1.two_pound


Module Contents
---------------

.. py:function:: fifty_pence(x: int) -> int

.. py:function:: five_pence(x: int) -> int

.. py:function:: one_pence() -> int

.. py:function:: one_pound(x: int) -> int

.. py:function:: 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


.. py:function:: ten_pence(x: int) -> int

.. py:function:: twenty_pence(x: int) -> int

.. py:function:: two_pence(x: int) -> int

.. py:function:: two_pound(x: int) -> int