{"push_id":886854818,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f653c111ff50d4b70f14a0ef202a42aa5bf8eed5","before":"4b70194c44c50b91aa9cf3ca2f475c4187696917","commits":[{"sha":"f653c111ff50d4b70f14a0ef202a42aa5bf8eed5","author":{"email":"b57f356ee75ce88d8e4d72a409da5a1ef9ead094@gmail.com","name":"iyaa"},"message":"문제에 대한 정확한 이해 및, 그래프로의 변환 후 최대 거리 찾기.","distinct":true,"url":"https://api.github.com/repos/iyaacs/algospot/commits/f653c111ff50d4b70f14a0ef202a42aa5bf8eed5"}]}