{"push_id":724840096,"size":3,"distinct_size":3,"ref":"refs/heads/master","head":"389b842e475b35fbbf8946333f094ef2bd75a576","before":"c7549306d57c98b47dea90a5e4a29fd7ae110d96","commits":[{"sha":"ea82765b702eb52cef4984fd9f96160adb0eacfd","author":{"email":"39b9fe5f4d8f80b9bdb06f0f5c17f8de2af3693a@cimat.mx","name":"davidjacobo"},"message":"Number theory, ad-hoc\n\nSigned-off-by: davidjacobo <jguillen@cimat.mx>\n\nBasically we can use any 4^x * 7^y as a multiplier of the input\nnumber A. The key observation here is that the only way to add\ntrailing zeroes is by multiplying 4*5, so we can skip every trailing\nzero on A and multiply by 4 (2 shifts to the left) every time our\ninput ends (least important digit) in 5.","distinct":true,"url":"https://api.github.com/repos/davidjacobo/Competencias/commits/ea82765b702eb52cef4984fd9f96160adb0eacfd"},{"sha":"fea98cfd35da46289c2716bf230a3a3f247b5cd5","author":{"email":"39b9fe5f4d8f80b9bdb06f0f5c17f8de2af3693a@cimat.mx","name":"davidjacobo"},"message":"updating the repo with weekend's code\n\nMerge branch 'master' of https://github.com/davidjacobo/Competencias\n\nAdding problems solved on my mobile computer","distinct":true,"url":"https://api.github.com/repos/davidjacobo/Competencias/commits/fea98cfd35da46289c2716bf230a3a3f247b5cd5"},{"sha":"389b842e475b35fbbf8946333f094ef2bd75a576","author":{"email":"39b9fe5f4d8f80b9bdb06f0f5c17f8de2af3693a@cimat.mx","name":"davidjacobo"},"message":"Ad hoc, caesar cipher\n\nSigned-off-by: davidjacobo <jguillen@cimat.mx>\n\nDeploy a basic Caesar's cipher code","distinct":true,"url":"https://api.github.com/repos/davidjacobo/Competencias/commits/389b842e475b35fbbf8946333f094ef2bd75a576"}]}