{"push_id":609179414,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6a684029ce9b31f22271bfa5575b2b2b0086911c","before":"8955ed952b870f38b87abde27f303045d53285b2","commits":[{"sha":"6a684029ce9b31f22271bfa5575b2b2b0086911c","author":{"email":"9f6aee9d069c688b9fbdb7cdc1723741417b3b28@gmail.com","name":"yezhangxiang"},"message":"filling knapsack with dynamic programming","distinct":true,"url":"https://api.github.com/repos/yezhangxiang/DiscreteOptimization/commits/6a684029ce9b31f22271bfa5575b2b2b0086911c"}]}