{"push_id":2825810712,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8ce226a945e5501480d9dcb6bfb720b911a163e0","before":"f743d78749b3bc92297d7178a755546851d5ff72","commits":[{"sha":"8ce226a945e5501480d9dcb6bfb720b911a163e0","author":{"name":"Chao Shi","email":"cb87317e4b6ff7f7e42c80ee67a56c545267b4f6@hpe.com"},"message":"410: Split array into M get min of max sum (Very Hard)","distinct":true,"url":"https://api.github.com/repos/chao-shi/lclc/commits/8ce226a945e5501480d9dcb6bfb720b911a163e0"}]}
{"actor":{"display_login":"chao-shi"}}