{"push_id":2757722944,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"f4838ae3b93000a66d60c19ca6878057622e7260","before":"b0f736c9ef5e3b1cc0cedc89117f0361eed8d751","commits":[{"sha":"9c5e2d3981ab883470c2895f6d6f5052f847b345","author":{"name":"runewalsh","email":"85beb375afea9a923d60f9005a20d2a7c195645e@inbox.ru"},"message":"Глупая оптимизация, не меняющая асимптотики O(√N).\n\nМожно сразу выколоть числа, делящиеся на 2 и 3:\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20\nX X X   X   X X X     X     X  X  X     X     X\nВидно, что оставшиеся для проверки образуют паттерн +2,+4, начиная с 5.","distinct":true,"url":"https://api.github.com/repos/PoppyFanboy/Project-Euler-Solutions/commits/9c5e2d3981ab883470c2895f6d6f5052f847b345"},{"sha":"f4838ae3b93000a66d60c19ca6878057622e7260","author":{"name":"PoppyFanboy","email":"a42a4d965fb57b2a1a55a92d3a835e2502d86bc8@users.noreply.github.com"},"message":"Merge pull request #1 from runewalsh/master\n\nГлупая оптимизация, не меняющая асимптотики O(√N).","distinct":true,"url":"https://api.github.com/repos/PoppyFanboy/Project-Euler-Solutions/commits/f4838ae3b93000a66d60c19ca6878057622e7260"}]}
{"actor":{"display_login":"PoppyFanboy"}}