{"repository":{"description":"Backtracking: Find all combos of integers from 1 to N that sum to N, without repeats.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"bradyallenjohnson","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-10-27T08:29:36-07:00","pushed_at":"2013-10-27T08:30:57-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Brady Johnson","company":"Ericsson","blog":"http://stackoverflow.com/users/1158895/brady","location":"Neither here not there","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/bradyallenjohnson/IntComboSum/compare/26a70a727d...376d9e78d8"}