{"push_id":2727585347,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7869037e90a14b7f7ef5df6ada20901281d0a7f1","before":"640770be217588bafb473e143565baa1b643c5b7","commits":[{"sha":"7869037e90a14b7f7ef5df6ada20901281d0a7f1","author":{"name":"blisstoner","email":"d22681afc777029c7c3caf5c9fd205284312af5e@users.noreply.github.com"},"message":"[BOJ] 3946번: Maximum Random Walk\n\nDynamic Programming","distinct":true,"url":"https://api.github.com/repos/blisstoner/BOJ/commits/7869037e90a14b7f7ef5df6ada20901281d0a7f1"}]}
{"actor":{"display_login":"blisstoner"}}