Comments on: Euler Problem 124 http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/ Daily posts of Excel tips…and other stuff Wed, 08 Feb 2012 23:58:05 +0000 hourly 1 http://wordpress.org/?v=3.2.1 By: JoshG http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40454 JoshG Mon, 03 Aug 2009 16:21:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40454 <p>Hi Michael,<br> Thanks for posting the code. It works fine for me - not sure what my problem was. I managed to adapt it to solve #77. I'll post it in your thread for #76, since it seems more appropriate there.</p> <p>-Josh</p> Hi Michael,
Thanks for posting the code. It works fine for me – not sure what my problem was. I managed to adapt it to solve #77. I’ll post it in your thread for #76, since it seems more appropriate there.

-Josh

]]> By: Michael http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40446 Michael Sun, 02 Aug 2009 19:35:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40446 <p>Hi Tushar -</p> <p>Thank you, but you misunderstand...we've both solved 31 (that code above is a different recursive solution to 31) and we're are looking therein for hint to a solution to 77. Rather than units of currency, #77 uses prime numbers.</p> <p>Trying to make a fit ;-)</p> <p>...mrt</p> Hi Tushar -

Thank you, but you misunderstand…we’ve both solved 31 (that code above is a different recursive solution to 31) and we’re are looking therein for hint to a solution to 77. Rather than units of currency, #77 uses prime numbers.

Trying to make a fit ;-)

…mrt

]]> By: Tushar Mehta http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40445 Tushar Mehta Sun, 02 Aug 2009 18:51:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40445 <p>Michael, Josh,</p> <p>If you are looking for a solution to 31 you may want to check<br> Project Euler - Problem 31<br> <a href="http://www.tushar-mehta.com/misc_tutorials/project_euler/euler031.html" rel="nofollow">http://www.tushar-mehta.com/misc_tutorials/project_euler/euler031.html</a></p> Michael, Josh,

If you are looking for a solution to 31 you may want to check
Project Euler – Problem 31
http://www.tushar-mehta.com/misc_tutorials/project_euler/euler031.html

]]> By: Michael http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40444 Michael Sun, 02 Aug 2009 17:56:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40444 <p>Hi Josh -</p> <p>It runs out of stack space for me in Mac XL 2004. Runs fine in XL2002. For what it's worth:</p> <div style="overflow: auto; white-space: nowrap;" class="codecolorer-container vb default"><div style="white-space: nowrap;" class="vb codecolorer"><span class="kw1">Private</span> coins(0 <span class="kw1">To</span> 7) <span class="kw1">As</span> <span class="kw1">Long</span><br> <span class="kw1">Sub</span> Main()<br>    coins(0) = 200<br>    coins(1) = 100<br>    coins(2) = 50<br>    coins(3) = 20<br>    coins(4) = 10<br>    coins(5) = 5<br>    coins(6) = 2<br>    coins(7) = 1<br>     <br>    Debug.<span class="kw1">Print</span> findposs(200, 0)<br>    <br> <span class="kw1">End</span> <span class="kw1">Sub</span><br> <span class="kw1">Function</span> findposs(money <span class="kw1">As</span> <span class="kw1">Long</span>, maxcoin <span class="kw1">As</span> <span class="kw1">Long</span>) <span class="kw1">As</span> <span class="kw1">Long</span><br>    <span class="kw1">Dim</span> sum <span class="kw1">As</span> <span class="kw1">Long</span>, i <span class="kw1">As</span> <span class="kw1">Long</span><br>    <br>    sum = 0<br>    <span class="kw1">If</span> maxcoin = 7 <span class="kw1">Then</span><br>       findposs = 1<br>       <span class="kw1">Exit</span> <span class="kw1">Function</span><br>    <span class="kw1">End</span> <span class="kw1">If</span><br>    <br>    <span class="kw1">For</span> i = maxcoin <span class="kw1">To</span> 7<br>       <span class="kw1">If</span> money - coins(i) = 0 <span class="kw1">Then</span> sum = sum + 1<br>       <span class="kw1">If</span> money - coins(i) > 0 <span class="kw1">Then</span> sum = sum + findposs(money - coins(i), i)<br>    <span class="kw1">Next</span> i<br>    <br>    findposs = sum<br>    <br> <span class="kw1">End</span> <span class="kw1">Function</span></div></div> <p>...mrt</p> Hi Josh -

It runs out of stack space for me in Mac XL 2004. Runs fine in XL2002. For what it’s worth:

Private coins(0 To 7) As Long
Sub Main()
   coins(0) = 200
   coins(1) = 100
   coins(2) = 50
   coins(3) = 20
   coins(4) = 10
   coins(5) = 5
   coins(6) = 2
   coins(7) = 1
   
   Debug.Print findposs(200, 0)
   
End Sub
Function findposs(money As Long, maxcoin As Long) As Long
   Dim sum As Long, i As Long
   
   sum = 0
   If maxcoin = 7 Then
      findposs = 1
      Exit Function
   End If
   
   For i = maxcoin To 7
      If money – coins(i) = 0 Then sum = sum + 1
      If money – coins(i) &gt; 0 Then sum = sum + findposs(money – coins(i), i)
   Next i
   
   findposs = sum
   
End Function

…mrt

]]> By: JoshG http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40437 JoshG Sun, 02 Aug 2009 02:59:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40437 <p>Michael,<br> Would you mind posting your translation of #31 in VBA? I keep running out of stack space, so I must be doing something wrong. Thanks.</p> <p>-Josh</p> Michael,
Would you mind posting your translation of #31 in VBA? I keep running out of stack space, so I must be doing something wrong. Thanks.

-Josh

]]> By: Michael http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40431 Michael Fri, 31 Jul 2009 21:15:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40431 <p>Josh -</p> <p>Great thinking alike ;-)</p> <p>There's a neat recursive answer to #31 that drew Euler's praise right at the top. It translates easily to VBA. Works very well for 8 coins. Not quite sure how to adapt it to a potful of primes.</p> <p>...mrt</p> Josh -

Great thinking alike ;-)

There’s a neat recursive answer to #31 that drew Euler’s praise right at the top. It translates easily to VBA. Works very well for 8 coins. Not quite sure how to adapt it to a potful of primes.

…mrt

]]> By: JoshG http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40430 JoshG Fri, 31 Jul 2009 21:03:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40430 <p>Hi Michael,<br> Let's just say that there are a few days where I don't get any real work done...</p> <p>I'm having the same problems as you - I couldn't see how to re-use my #76 code for #77, and I couldn't really understand the others' solutions. There's a link to the MathWorld article on prime partitions, but I couldn't see how to apply it. Bah. Maybe I should go back and look at the expert solutions to #31.</p> <p>-Josh</p> Hi Michael,
Let’s just say that there are a few days where I don’t get any real work done…

I’m having the same problems as you – I couldn’t see how to re-use my #76 code for #77, and I couldn’t really understand the others’ solutions. There’s a link to the MathWorld article on prime partitions, but I couldn’t see how to apply it. Bah. Maybe I should go back and look at the expert solutions to #31.

-Josh

]]> By: Michael http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40428 Michael Fri, 31 Jul 2009 20:24:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40428 <p>Hi Tushar -</p> <p>Yep, that'll work if you can paste 100,000 rows. But I'm row-challenged still ;-)</p> <p>I get a nasty alert that says "File not loaded completely" when I paste it. And if I can only use and sort the top 65536 rows, the correct answer is in there, but it's not even close to A10000.</p> <p>What I thought would be neat was a way to get 100000 rows off the web into an array. An XL2007 webquery probably will.</p> <p>...mrt</p> Hi Tushar -

Yep, that’ll work if you can paste 100,000 rows. But I’m row-challenged still ;-)

I get a nasty alert that says “File not loaded completely” when I paste it. And if I can only use and sort the top 65536 rows, the correct answer is in there, but it’s not even close to A10000.

What I thought would be neat was a way to get 100000 rows off the web into an array. An XL2007 webquery probably will.

…mrt

]]> By: Tushar Mehta http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40427 Tushar Mehta Fri, 31 Jul 2009 19:04:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40427 <p>You know what I am going to write, don't you?</p> <p>VBA for the cheat version? Why?</p> <p>Copy the data from the web page you mentioned.</p> <p>Paste the data into Excel. I put the data in cols. A and B.</p> <p>Sort on: B ascending then A ascending.</p> <p>Go to A10000. Get the answer.</p> You know what I am going to write, don’t you?

VBA for the cheat version? Why?

Copy the data from the web page you mentioned.

Paste the data into Excel. I put the data in cols. A and B.

Sort on: B ascending then A ascending.

Go to A10000. Get the answer.

]]> By: Michael http://www.dailydoseofexcel.com/archives/2009/07/28/euler-problem-124/#comment-40425 Michael Fri, 31 Jul 2009 18:21:00 +0000 http://www.dailydoseofexcel.com/?p=2725#comment-40425 <p>Hi Josh -</p> <p>Following your steer to the BASIC statistics, Dick should reverse our roles. In one sense I'm only about 30 behind you, but in the other I'm about 110 behind you. That's a lot of coding! I better get hot ;-) </p> <p>There's probably few, if any, I've done that you've not, so I'll put #76 up anyway. I have a good reference I can point to. #77 is driving/drove me buggy. I know the answer, it's in the OEIS. I just can't <i>compute</i> the answer. The Haskell one-liners are no help and the one guy who put up some BASIC is so obfuscated that I can't follow his juggling indices. I can often translate the Ruby, C, and Java, never the Python. Those guys say they just hacked their 76 code. Well, that's the part I can't get...</p> <p>Thank you for the Insertion sort...looks very useful.</p> <p>...mrt</p> Hi Josh -

Following your steer to the BASIC statistics, Dick should reverse our roles. In one sense I’m only about 30 behind you, but in the other I’m about 110 behind you. That’s a lot of coding! I better get hot ;-)

There’s probably few, if any, I’ve done that you’ve not, so I’ll put #76 up anyway. I have a good reference I can point to. #77 is driving/drove me buggy. I know the answer, it’s in the OEIS. I just can’t compute the answer. The Haskell one-liners are no help and the one guy who put up some BASIC is so obfuscated that I can’t follow his juggling indices. I can often translate the Ruby, C, and Java, never the Python. Those guys say they just hacked their 76 code. Well, that’s the part I can’t get…

Thank you for the Insertion sort…looks very useful.

…mrt

]]>