I appreciate your input Bruno. I did figured it out later on, however, I should have paid more attention to the mathematical definition, and rely less on the text description of the problem :) Take care, Merg On Sunday, April 15, 2012 1:13:53 PM UTC-4, BrunoOliveira wrote: > > Hey merg, > > In fact, 10 and 40 are not m and n but yes A and B. > > That means you have 3 distinct pairs of recycled numbers between 10 and 40 > which are very easily caught by hand: > > 12,21 > 13,31 > 23,32 > > 10 and 40 are not a pair of recycled numbers in this case. Also, there can > be no leading zeroes. > > On Sat, Apr 14, 2012 at 7:11 PM, Merg <[email protected]> wrote: > >> Hello, >> >> Can someone please elaborate a bit further on problem C? >> >> When the problem states "a pair of distinct positive integers (n, m) >> is recycled if you can obtain m by moving some digits from the back of >> n" >> >> How can we obtain 40 (m) by moving 0 (back of n) from 10 (n)? >> >> 10 40 Case #2: 3 >> >> Thanks in advance for your help. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Google Code Jam" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/google-code?hl=en. >> >> >
-- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To view this discussion on the web visit https://groups.google.com/d/msg/google-code/-/SKPJsXZPkEwJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-code?hl=en.
