Code Puzzle #1 - Solution

re: Code Puzzle #1 - Solution

youtubeline — Sun, 13 Dec 2009 15:31:06 GMT

I had to write it in Ruby, as that's the language I'm trying to gain proficiency in.

It doesn't run fast, but it was fast to code :).

string puzzle solution

string puzzle solution — Thu, 12 Jun 2008 14:45:27 GMT

Pingback from string puzzle solution

re: Code Puzzle #1 - Solution

Mark Tolonen — Sat, 29 Sep 2007 06:37:52 GMT

From the Python command prompt:

>>> for n in xrange(1000000):

... if n%10==0: continue

... r=int(str(n)[::-1])

... if n==r: continue

... if n%r==0: print n

...

8712

9801

87912

98901

879912

989901

>>>

re: Code Puzzle #1 - Solution

Jon Galloway — Sun, 06 May 2007 20:21:57 GMT

@angel - The answer is a pearl. http://dan.hersam.com/riddles.html

a little help please

angel — Sun, 06 May 2007 17:34:09 GMT

hi your website is very nice i want a little sorry the solution for this puzzle

"I live in water,if you cut my head iam at your door,if you cut my tail iam a fruit , if you cut both then iam with you"

please send me the solution for this

re: Code Puzzle #1 - Solution

Jon Galloway — Mon, 20 Nov 2006 17:46:08 GMT

@Helen - Take a look at the puzzle rules. I didn't include them since I don't consider 001 a valid number. I'm sure James Bond might take issue with that.

re: Code Puzzle #1 - Solution

Helen — Mon, 20 Nov 2006 17:03:56 GMT

Shouldn't you be getting results like 100 is divisible by 001?

re: Code Puzzle #1 - Solution

Scott Patten — Fri, 17 Nov 2006 06:29:27 GMT

Fun puzzle!

I had to write it in Ruby, as that's the language I'm trying to gain proficiency in.

It doesn't run fast, but it was fast to code :).

#!/usr/bin/env ruby

class Integer

def reverse

r = "#{self}".reverse

return nil if r =~ /^0/ or r.to_i == self

return r.to_i

end

biggest = 1000000

(1 .. biggest).each do |n|

if n.reverse

puts n if n % n.reverse == 0

end

re: Code Puzzle #1 - Solution

Mikael Kjellqvist — Thu, 09 Nov 2006 12:58:39 GMT

Just wanted to point out a small 'error' in the otherwise very nice function Reverse(Integer).

Function Reverse(ByVal n As Integer) As Integer

Dim rev As Integer = 0

While n > 0

rev = rev * 10 + (n Mod 10)

n = n \ 10

End While

Return rev

End Function

Try calling the Reverse function with the number 581. the result will not be whats expected.

This is becouse 58 / 10 does not return 5, but instead is rounder up to 6.

One solution is to change the line to:

n = Math.floor(n \ 10)

I liked the puzzle btw :)

re: Code Puzzle #1 - Solution

Haacked — Thu, 09 Nov 2006 08:09:53 GMT

Another interesting property of those numbers is that they all are divisible by 9.