{"push_id":2940225702,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"cf27282527fcd125941115b960ba7de9599a3966","before":"7ce96a34510dd81888dc1ef96b0e3bb9e3c5cf73","commits":[{"sha":"b1c29cb6c98be18c6932f01d29808b462564effa","author":{"name":"bag-PacKer","email":"2b743b0cf2c12b7115a04594979783521c360a7d@users.noreply.github.com"},"message":"Create ModularGCD.cpp\n\nUsing Euclidean Modular formula's extended find GCD for Large Numbers.","distinct":true,"url":"https://api.github.com/repos/rathoresrikant/competitive-programming-solutions/commits/b1c29cb6c98be18c6932f01d29808b462564effa"},{"sha":"cf27282527fcd125941115b960ba7de9599a3966","author":{"name":"Srikant Singh","email":"9923780a451fd64f01f1233d01ab7ceca8d856c9@nitk.edu.in"},"message":"Merge pull request #40 from bag-PacKer/patch-2\n\nCreate ModularGCD.cpp","distinct":true,"url":"https://api.github.com/repos/rathoresrikant/competitive-programming-solutions/commits/cf27282527fcd125941115b960ba7de9599a3966"}]}
{"actor":{"display_login":"rathoresrikant"}}