{"push_id":1814336815,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"27b55eb7937e20027a9b5c3feb220db29e44f47d","before":"642157c0da2aa415b2117587421651aea9a40e74","commits":[{"sha":"27b55eb7937e20027a9b5c3feb220db29e44f47d","author":{"name":"Paulo Mendes","email":"6ec37d60e8044e8a81842f29a2d1fe9a94765aa2@users.noreply.github.com"},"message":"Create Project Euler 114 and 115.lisp\n\nf (m, n) calculates in how many ways it's possible to fill a space of length n with tiles of length equal to or greater than m while leaving at least one unit of space between adjacent tiles.\r\n\r\nf (3, 50) solves problem 114 and f(50, 57) solves problem 115","distinct":true,"url":"https://api.github.com/repos/pcmendes1973/lisp/commits/27b55eb7937e20027a9b5c3feb220db29e44f47d"}]}
{"actor":{"display_login":"pcmendes1973"}}