{"push_id":1444402851,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"ecb03fd929ab9cb826a7a1cee2f4fbb54f1d1d31","before":"f6def4b94161d35d3f386745714d302da78204da","commits":[{"sha":"ecb03fd929ab9cb826a7a1cee2f4fbb54f1d1d31","author":{"name":"Dang Nguyen","email":"b3e4e9bb4262b9512df61d95b4d642dd6c9018d1@gmail.com"},"message":"A greedy problem.\n\nSolve in O(n^2) with an array for counting.","distinct":true,"url":"https://api.github.com/repos/phidang/Codeforces/commits/ecb03fd929ab9cb826a7a1cee2f4fbb54f1d1d31"}]}
{"actor":{"display_login":"phidang"}}