{"push_id":2667885660,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"4db750a981a81cc006f9f7336ba9986ab16ad476","before":"6ab83de44abc6ff8c602ae20041440f794ffcccb","commits":[{"sha":"4db750a981a81cc006f9f7336ba9986ab16ad476","author":{"name":"Rafael Soares Pinto","email":"435dae326450f67e4fb5dbcf852e5335f16dfb0c@gmail.com"},"message":"major updated in the code\n\nnow the code returns not just the optimal profit for the set of items, but also which items should be on the list, for each iteration. Some comments were included in the code.","distinct":true,"url":"https://api.github.com/repos/rsoaresp/knapsackGo/commits/4db750a981a81cc006f9f7336ba9986ab16ad476"}]}
{"actor":{"display_login":"rsoaresp"}}