python.p0031 Namespace Reference

Functions
def	calculate
def	coin_combinations
def	main ()

Detailed Description

Project Euler Problem 31

This took a while to get in a form that I was happy with. I wanted something
more flexible than "let's take 8 for loops", so I did my best to make this as
modular as I could think to do.

Problem:

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 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
How many different ways can £2 be made using any number of coins?

Function Documentation

def python.p0031.calculate

(

counts

)

Here is the caller graph for this function:

def python.p0031.coin_combinations

(

amount

)

Here is the call graph for this function:

Here is the caller graph for this function:

def python.p0031.main

(

int

)

Here is the call graph for this function: