Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re^3: Puzzle Time

by LanX (Canon)
on Dec 23, 2012 at 15:25 UTC ( #1010106=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Puzzle Time
in thread Puzzle Time

> Allow me one nit-pick:

Yeah I noticed this, but was too tired to correct it. =)

Anyway my guess was wrong (9!+8!+7!+...) you got it right.

> (way faster than my brute force approach).

If it's about speed you can limit the $maxlevel, because the longest number can't have more than 7 digits:

  1. Evidently 0 is excluded!

  2. Any number this long includes even ciphers. So 5 is excluded! But any number divisible by 5 and 2 must end with a 0

  3. An number from the remaining 8 digits would include 9 and 3, but the digit sum would be 40, which is impossible.

Even your approach with a brute force loop could compete when only considering 7 digits, cause you don't have the overhead of 1 million function calls.

Cheers Rolf

) and therefor a 7 digit number excludes 4 to be divisible by 9.


Comment on Re^3: Puzzle Time

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1010106]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (9)
As of 2015-07-03 16:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (54 votes), past polls