{"push_id":792726847,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8c320930489f0418fa8e3831815f51695530a170","before":"1ff36a8e3632eea360d7301f25ad3f64f0ca0b6e","commits":[{"sha":"8c320930489f0418fa8e3831815f51695530a170","author":{"email":"f99f3134036fab90523a65eda006d79ea7f08410@sina.com","name":"DamonLiuNJU"},"message":"扩展欧几里德算法，毕竟不是自己专业，有难度。。\n\n只是复习一下GCD的欧几里德算法，GCD（a，b）＝GCD（b，amod b）","distinct":true,"url":"https://api.github.com/repos/DamonLiuNJU/POJ/commits/8c320930489f0418fa8e3831815f51695530a170"}]}