{"push_id":831730773,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2197fe34ceceba88cd2c176381eced6ed39b9519","before":"a3df6b7a2844a17218e46931a8e2edafe7f8246b","commits":[{"sha":"2197fe34ceceba88cd2c176381eced6ed39b9519","author":{"email":"4f9f1f02ab384112c528de13fbc9ce2de839d93b@gmail.com","name":"ChaesooRim"},"message":"Solving the Finding Max. It's a divide and conquer algorithm","distinct":true,"url":"https://api.github.com/repos/ChaesooRim/MAD/commits/2197fe34ceceba88cd2c176381eced6ed39b9519"}]}