{"push_id":2861897892,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d4f8e4a8db55bd92c0d71e6dbf5353b5829f2529","before":"fe740bcdaab045dbd6b91f6dd12c8042d934c66f","commits":[{"sha":"d4f8e4a8db55bd92c0d71e6dbf5353b5829f2529","author":{"name":"JiEun","email":"979ef1aaf741668f8bb51eb3d247ec073224d958@naver.com"},"message":"다이나믹 프로그래밍1\n\n쉬운 계단 수,오르막 수 1,2,3 더하기 등 문제 풀기","distinct":true,"url":"https://api.github.com/repos/kje6445/skhucode-jieun/commits/d4f8e4a8db55bd92c0d71e6dbf5353b5829f2529"}]}
{"actor":{"display_login":"kje6445"}}