I seemed to have found a Python solution for Pascal Walk, but it kept coming back as wrong answer. I'm trying to figure out why. My methodology was to go down the left side (+1 for every line) of the pascal walk until the current sum+ 2^(n-1) was greater than the target number. Then, I'd add up the numbers in that line until adding would go over the target number. Then, I'd just take a small detour in the remainder to achieve the target number. If the remainder was too big, i'd recurse using the next line and eventually reach a working remainder. I made a function that checked the sum and I can't find a number, especially under 501, where the sum is incorrect. Either my summing function is incorrect, or my entire methodology is incorrect, and any help to figure this out would be really appreciated. Here is my code:https://pastebin.com/D3ZJVsQW
-- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to google-code+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/0f15d016-fe43-484a-a630-bbea2c3092c7%40googlegroups.com.
