{"push_id":3096158936,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"eff366e089ad613dd81fcda6e66c038397a46ee2","before":"fd367fc2ada7f1ae958fc7e23f1ed7c6afd6785e","commits":[{"sha":"eff366e089ad613dd81fcda6e66c038397a46ee2","author":{"name":"Teingi","email":"fdd62e763edcd9eb549e90dd66a8cf95bc64e6f2@ruc.edu.cn"},"message":"三角形最小路径和","distinct":true,"url":"https://api.github.com/repos/Teingi/test/commits/eff366e089ad613dd81fcda6e66c038397a46ee2"}]}
{"actor":{"display_login":"Teingi"}}