For instance: In the case of 11 base 7: 11 base 7 = 14 *1^2 + 4^2 = 17* 17 base 7 = 23 2^2 + 3^2 = 13 13 base 7 = 16 1^2 + 6^2 = 37 37 base 7 = 52 5^2 + 2^2 = 29 29 base 7 = 41 *4^2 + 1^2 = 17* .....
How can we check for a cycle in this case? This is a cycle of 4 numbers.. Can you please help in an algorithm to check for a cycle in n numbers.. If i use recursion i wont be able to check the cycle rite? 2 conditions to be checked: 1. cycle of n numbers 2. if sum is 1 thanks, Maverick -- You received this message because you are subscribed to the Google Groups "google-codejam" 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.
