For round 2009 1A, problem A (Multibase Happyness): can it be inferred that all bases are <= 10? I didn't think so from the way the problem was posed, but the datasets seem to imply it. Mabye it could be inferred from the word "digits"?
My initial naive algorithm failed on the large dataset. Now I made one that caches the results per each task, but even that takes very long (as the happy num for the second task is > 11000000 I think). So I think I should probably cache over tasks and bases - that would be easy to do if all the bases were <= 10, but would maybe make less sense if bases could be arbitrarily large. Presumably there is an even easier way, but I am too much out of practice with mathematics atm to think about it :-) --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
