Skip to main content

Problem 31 Project Euler Solution with python

Coin sums

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?

 Actually a lot of people are confused with the question. First of all let me explain to you the meaning of the question and then I will tell you the approach to solution.

 As in case of every currency, also in England we have decimal places for a sum of money. For example 2.33, 5.05, 4.2 and so on. Now in 2.33, 2 is called the pound(£) and 33 is called as pence(p). To get 33 pence we can use 20 pence, 10 pence, 2 pence and 1 pence. We can also form the same 33 pence in many different ways. A similar question was asked to be solved.

 Now coming back to our problem, firstly we will have to determine the maximum number of coins for each and every denomination.

Denomination Maximum Number of coins
1p 200
2p 100
5p 40
10p 20
20p 10
50p 4
100p(1£) 2
200p(2£) 1

We can form 2£ in many ways from the above denominations. But for our calculation purposes I will assume some notations for each and every denomination.

Denomination Symbol
1p x1
2p x2
5p x3
10p x4
20p x5
50p x6
100p(1£) x7
200p(2£) x8

So to write the question in mathematical equation format it can be written as:

x1+2x2+5x3+10x4+20x5+50x6+100x7+200x8 = 200

{x1,x2,x3,x4,x5,x6,x7,x8} ∈ Integers

As you can see the maximum value and the only value x8 can take is 1. So to reduce the complexity in our problem we can eliminate x8 in the equation. But to the final solution we will add the 1 possibility. 

 So for our solution we will take x8 = 0 and we can add 1 to the final count.So the equation will become
x1+2x2+5x3+10x4+20x5+50x6+100x7 = 200

 Now we have one equation with 7 unknowns. But we know that with one equation we can only find the value of one variable.

 Okay, Lets say I will first choose 100p denomination and give some a coins,
then the maximum number of 50p coins I can use will become
(200-100a)/50 = b(say)

Now the maximum number of 20p coins I can use will become
(200-100a-50b)/20 = c(say)

Maximum number of 10p coins I can use will become (200-100a-50b-20c)/10 = d(say)

maximum number of 5p coins I can use will become (200-100a-50b-20c-10d)/5 = e(say)

maximum number of 2p coins I can use will become (200-100a-50b-20c-10d-5e)/2 = f(say)

If you have observed out of 7 variables in the equation we have already fixed 6 variables and now the resulting will be the number of 1p coins which I can use directly.

So there is no need for any calculations at the end for the number of 1p coins.

  The same has been used in the program. See the program and you will understand it easily.

Program

There are a series of for loops in this program. 

I have added 1 with the counter at the end so that we can find the total value including the 200p case. If you remember we have left x8 from our equation.

 As always you can download the source code from Github Gist pep31.py .

Output


Summary

This problem has been relatively easy for me to solve. But when I solved for the first time I wrote a program which would loop for around 128000000. If I had used that program then it would have taken hours to get executed. But after that I thought of starting from 100p instead of 1p then I ended up writing the above program which would loop only the required number of times(Answer). I am satisfied with the speed with which the program gets executed. As always I think there is a scope for improvement still. I was unable to eliminate the for loops. May be one can think in that point of view.

 If you haven't understood anything or have any doubt then comment in the comment box below and I will be glad to help you.

 Please do comment if you have found any typo or if you have any better program or different program or if you have any suggestion. I will be glad to view each and every one of them.

 You can also contact me.

Thank you. Have a nice day.
Labels:

Popular posts from this blog

Making a quiz web app with python and flask

Edit : When you are creating a web app with h tml templates, then y ou will have to sa ve the html file in templates folder in the Current Wor ki ng Directory( CWD). If you save the file in the C W D directl y you will get a TemplateNotFound error. Thank you Udhay for pointing it out.   In this post we will create a quiz website using python . I will be using the flask framework . After reading this tutorial you will learn form submission , flask templates , python code in flask templates , shuffling the questions and options with the random module and few others.  Please note that this tutorial is not big as it seems to be. Some of the code has been rewritten to maintain consistency and also font size is somewhat big so that your eyes won't get stressed reading this tutorial. Also the content has not occupied the full width of the page. In this tutorial I am assuming that you are having a very basic understanding of the flask framework . Please refer the documentation
Read more

Problem 11 Project Euler Solution with python

Largest product in a grid In the 20×20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 04 52 08 83 97 35 99 16 07
Read more

Problem 60 Project Euler Solution with python

Prime pair sets The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property. Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime. This problem is j u st a brute force problem. If you have come here because you don't know the limit upto which you will h ave to gener ate the prime numbers t hen go ahe ad and t r y with 10,000 . When I first start ed solving the problem I chose 1 million(beca use most of the problem s on project E uler have this limit ), but it took very long for the computer to fin d the solution. After searching on the internet then I found many people choosing 10, 000 so I have changed my in put f rom 1 million to 10000 and the output was f ast. He
Read more