Thanks Alara. On Sunday, April 15, 2012 1:50:05 PM UTC-4, alara wrote: > > the numbers (n,m) in that case are: > > 12 21 > 13 31 > 23 32 > > > 2012/4/14 Merg <[email protected]>: > > 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. > > > > On Sunday, April 15, 2012 1:50:05 PM UTC-4, alara wrote: > > the numbers (n,m) in that case are: > > 12 21 > 13 31 > 23 32 > > > 2012/4/14 Merg <[email protected]>: > > 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. > > > > On Sunday, April 15, 2012 1:50:05 PM UTC-4, alara wrote: > > the numbers (n,m) in that case are: > > 12 21 > 13 31 > 23 32 > > > 2012/4/14 Merg <[email protected]>: > > 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/-/rNnd9EDevSwJ. 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.
