{"push_id":4039836198,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d8dd69058df595d8525b297b4f8c837f74592b84","before":"a8c4264b7db91e77a0b3bf005591f0f58dff9860","commits":[{"sha":"d8dd69058df595d8525b297b4f8c837f74592b84","author":{"name":"ABHIINAV12","email":"7a69c34a89090f0fd2e8df0f5ff2beabb44e6f17@users.noreply.github.com"},"message":"solved a problem using dp\n\nminimum cost of reaching last tower using dp where the cost of reaching a tower is difference between the current tower and the tower from  which it is reached","distinct":true,"url":"https://api.github.com/repos/ABHIINAV12/atcoder-/commits/d8dd69058df595d8525b297b4f8c837f74592b84"}]}
{"actor":{"display_login":"ABHIINAV12"}}