{"push_id":878051125,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c4ed2f1ff75dc5f1dc23466ad2d3ce5dd1d54c77","before":"2314b610257363bfa98a5f0115ca5bf259106ea0","commits":[{"sha":"c4ed2f1ff75dc5f1dc23466ad2d3ce5dd1d54c77","author":{"email":"5b63adc5d1d326243ea4b072a7eb65ed4139742f@gmail.com","name":"Shad Ullah Khan"},"message":"solved factorial using dynamic programming","distinct":true,"url":"https://api.github.com/repos/shaduk/competitive-programming/commits/c4ed2f1ff75dc5f1dc23466ad2d3ce5dd1d54c77"}]}