{"push_id":700567267,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4fe90e675753aab5c7f50416c33f656fabd4506a","before":"01ffa8711b424c2c1b3e442e41dc8f1e831cf356","commits":[{"sha":"4fe90e675753aab5c7f50416c33f656fabd4506a","author":{"email":"4afac3db47d1e6adaddb7445ce1ca0b0a32153dd@gmail.com","name":"jutoart"},"message":"Modified problem 100, the 3n+1 problem, to dynamic programming version","distinct":true,"url":"https://api.github.com/repos/jutoart/UVa_OnlineJudge/commits/4fe90e675753aab5c7f50416c33f656fabd4506a"}]}