{"push_id":1450694942,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f7586ea8c87ed8f8fda014cb27ad9203db1d0188","before":"ef961ac25f0d6017545cc27e0e8f88c3fa158f8e","commits":[{"sha":"f7586ea8c87ed8f8fda014cb27ad9203db1d0188","author":{"name":"Mark Blatnik","email":"dad7ad70824d6d02ff28816037e3ecb1524351e6@gmail.com"},"message":"C++ solution to Maximizing the Value of a Loot (Fractional Knapsack)","distinct":true,"url":"https://api.github.com/repos/mablatnik/Data-Structures-And-Algorithms/commits/f7586ea8c87ed8f8fda014cb27ad9203db1d0188"}]}
{"actor":{"display_login":"mablatnik"}}