{"push_id":748489306,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"dcfa151b74643f072d1cf5d3484eca7856f5b3b1","before":"6477f0c405cc505961f803a21cbec63b8e7fdf4f","commits":[{"sha":"dcfa151b74643f072d1cf5d3484eca7856f5b3b1","author":{"email":"f4d750d8a9aa98eb1324aea0773d85060038eef7@sjtu.edu.cn","name":"ZheWang711"},"message":"Krypton Factor, UVa 129\n输入L，n ；打印字典序n由字母表前L个字符组成的困难串（不存在相邻重复子串）","distinct":true,"url":"https://api.github.com/repos/ZheWang711/DataStructures_in_Python/commits/dcfa151b74643f072d1cf5d3484eca7856f5b3b1"}]}