{"push_id":766677801,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"05a397ee9439c367eb9d3e1c21e7e7626f778602","before":"9a35144009a13cfc5a31bb777f3bdfce2ba95126","commits":[{"sha":"5575798ea981e280d4f22daba6ccae2749a078cf","author":{"email":"9cf8f122e290d66560d036aead64f38593dbb540@gmail.com","name":"Georgy Shopov"},"message":"topcoder; solve \"LuckyXor\" from SRM #665 (Div. 2)","distinct":true,"url":"https://api.github.com/repos/gshopov/competitive-programming-archive/commits/5575798ea981e280d4f22daba6ccae2749a078cf"},{"sha":"05a397ee9439c367eb9d3e1c21e7e7626f778602","author":{"email":"9cf8f122e290d66560d036aead64f38593dbb540@gmail.com","name":"Georgy Shopov"},"message":"dmoj; solve \"Maximum Product\" from DMPG '15 Bronze","distinct":true,"url":"https://api.github.com/repos/gshopov/competitive-programming-archive/commits/05a397ee9439c367eb9d3e1c21e7e7626f778602"}]}