{"push_id":865930089,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"1d86ab03f37c616ee74739b9d59a2f10ac43593d","before":"b6cccd4f20a74bac8e5a4354150f0f7861da7a08","commits":[{"sha":"1d86ab03f37c616ee74739b9d59a2f10ac43593d","author":{"email":"8734b4d2fda26df8c0cbf04b1da96dac9048911c@michste-x1.redmond.corp.microsoft.com","name":"unknown"},"message":"Find a representaion of a number n as sum of k\ndifferent values where k is maximum possible.","distinct":true,"url":"https://api.github.com/repos/mspline/stepic/commits/1d86ab03f37c616ee74739b9d59a2f10ac43593d"}]}