{"push_id":726482679,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"b991d1fb3747672ac645698c58537449a55747d0","before":"331519d7f9efb0eabb3688d58fb6598dcced322e","commits":[{"sha":"5a0fe184ab7a3f893ff2a1d1d803cf5f1e24d72d","author":{"email":"1c9f6ae536383a751f4cf11501716776dfa82bc2@rock-chips.com","name":"Yakir Yang"},"message":"hdq: add 2039 program\n\nsimple math question which juedge is it an traingle\n\nSigned-off-by: Yakir Yang <ykk@rock-chips.com>","distinct":true,"url":"https://api.github.com/repos/yakir-Yang/acm/commits/5a0fe184ab7a3f893ff2a1d1d803cf5f1e24d72d"},{"sha":"b991d1fb3747672ac645698c58537449a55747d0","author":{"email":"1c9f6ae536383a751f4cf11501716776dfa82bc2@rock-chips.com","name":"Yakir Yang"},"message":"hdp: add 1062 program\n\nProblem Description\nIgnatius likes to write words in reverse way. Given a single\nline of text which is written by Ignatius, you should reverse\nall the words and then output them.\n\nInput:\nThe input contains several test cases. The first line of the\ninput is a single integer T which is the number of test cases.\nT test cases follow. Each test case contains a single line with\nseveral words. There will be at most 1000 characters in a line.\n\nOutput:\nFor each test case, you should output the text which is processed.\n\nSample Input:          Sample Output:\n1                      hello world!\nolleh !dlrow\n\nSigned-off-by: Yakir Yang <ykk@rock-chips.com>","distinct":true,"url":"https://api.github.com/repos/yakir-Yang/acm/commits/b991d1fb3747672ac645698c58537449a55747d0"}]}