Edit: Now using binary search on closest values along with memoization, Needs testing, but the idea is straightforward. This still relies on the fact that even and odd are increasing sequences. #!/usr/bin/env python # inspired by your code memo = {'even': {0: 1, 2: 2}, 'odd': {1: 1}} def f(k...
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867
user259867