{"push_id":627862164,"size":15,"distinct_size":15,"ref":"refs/heads/master","head":"02b4dad2bb04336f6fbda75cfb5fc9c499440d5f","before":"c3013e36573a972f55e41ec77e7195cff016ab83","commits":[{"sha":"8569cef280f570781bd376454e1d5baae5cbd5d6","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: prime necklaces solution\n\nworks via DFS, slooow on large numbers\n\nare all odd numbers == 0?","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/8569cef280f570781bd376454e1d5baae5cbd5d6"},{"sha":"1fe045b8b82d6b545b04a8bf1e455710840aacbd","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: odd number shortcut\n\ncan't make a prime necklace with odd number of beads","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/1fe045b8b82d6b545b04a8bf1e455710840aacbd"},{"sha":"5ce2a99e86877d4f159364a01feb1333de159a9d","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: Rehaul, build 2 lists\n\nincorrect, but feasible","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/5ce2a99e86877d4f159364a01feb1333de159a9d"},{"sha":"7f712fd7c08f7bebd3973dacd031ee2c6f671f16","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: broken... trying threads\n\nI think the py3 in this commit was submitted and got a 60%... so its\nalso broken, but is a step in the right direction since it is completing\nin time","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/7f712fd7c08f7bebd3973dacd031ee2c6f671f16"},{"sha":"3dcf81f2aa6371c75b6f8ee1e268135f8969d4b8","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: rework part 2\n\nreduce dimension of problem, first by finding sequences of even numbers\nthat have an existing prime loop, then by counting the number of ways\nthrough the possible odd values.","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/3dcf81f2aa6371c75b6f8ee1e268135f8969d4b8"},{"sha":"165969fd4c5c3b5bed69956f21b8c8e11831c214","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: correct sequence length calculation\n\nNeed to subtract 1 from the length of the sequence after removing the\nlast element... duhdoy","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/165969fd4c5c3b5bed69956f21b8c8e11831c214"},{"sha":"2e648c8c7484f654e0944e9afef7544bbb9bee9e","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: working again\n\nbut takes a long time still","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/2e648c8c7484f654e0944e9afef7544bbb9bee9e"},{"sha":"14b5dd10dfd0da42f7ccc9056c29ef1d520bf485","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: fixed gap storage, singleton filter\n\nwasn't making a copy of the list of gaps, so it would be deconstructed\nafter being 'saved'.\n\nsingleton filter was removing values correctly, but would leave an empty\nlist which would break the num_ways calculation. used filter to remove\nempty lists from the gaps","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/14b5dd10dfd0da42f7ccc9056c29ef1d520bf485"},{"sha":"d965b2ecb96ca56d728ab18dc0fb6e9463b4a790","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: more aggressive unique culling\n\ndon't have to calculate if  the set doesn't include all numbers and if\nthe reduced set of gaps contains a set more times than the number of its\nelements.\n\npossible that all this just increased running time thought :/","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/d965b2ecb96ca56d728ab18dc0fb6e9463b4a790"},{"sha":"421f8281fdd08f0e259b49c6b207517ae3a357f2","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: cull based on repeated gaps\n\ngaps that are repeated multiple times are special.\n\nif they are repeated more times than their length, there is no way to\nchoose one element from each set.\n\nif they are repeated the same number of times as their elements, we know\nthat we must choose their elements from them, so we can remove them and\nthe elements they contain from other gaps.\n\nif when removing elements, we notice that we have a shared number in the\nspecial set, then we know we cant select one from each successfully. And\nif we end up removing more gaps completely than we expected to, then we\nknow that another gap was fully covered by the set of elements in\nspecial sets (and thus would not be able to uniquely choose one of its\nown elements after we were forced to pick from the special sets.","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/421f8281fdd08f0e259b49c6b207517ae3a357f2"},{"sha":"e3e8c25838c15bcf933ced19fd0081a05d987a48","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"187: culling code reorganization\n\nmerge the culling code so that it is easier to do multiple culling runs\nover the gaps.","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/e3e8c25838c15bcf933ced19fd0081a05d987a48"},{"sha":"0b891673c3b27c15c5750a602ec5e8dfaf9f8712","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"10: Final working solution\n\nreturns the m'th letter from the end of the list of characters  (using\nthe integer at the end of the line)","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/0b891673c3b27c15c5750a602ec5e8dfaf9f8712"},{"sha":"0a10f5bc80604502487380184e41c8cc72cf3a10","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"185: final working solution\n\ndoesn't always reach completion,","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/0a10f5bc80604502487380184e41c8cc72cf3a10"},{"sha":"677bc324eab2524ca50a426a571d6f6574bbe61a","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"3: working solution for greatest prime palindrome\n\nuses generators _to the max_ to find the highest valued prime palindrome","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/677bc324eab2524ca50a426a571d6f6574bbe61a"},{"sha":"02b4dad2bb04336f6fbda75cfb5fc9c499440d5f","author":{"email":"26b4257d5797cb2d9de3df4937577972be375dcd@gmail.com","name":"Carl Vanderlip"},"message":"3: remove sqrt\n\nnot needed since the check is happening from highest to lowest value, in\nmost cases its just wasted calculation","distinct":true,"url":"https://api.github.com/repos/cciivv/codeeval/commits/02b4dad2bb04336f6fbda75cfb5fc9c499440d5f"}]}