{"push_id":1474811433,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"5cb3567076b9c65abc8acce675f529012ef5b363","before":"21f6741b04ccbd6bdbfab59e8a3e4cf002979961","commits":[{"sha":"5cb3567076b9c65abc8acce675f529012ef5b363","author":{"name":"nosovairena","email":"84d72206012dfc20d2ae0c0c28ae392bd92c4298@gmail.com"},"message":"Add files via upload\n\nThis program gets a number of test cases, gets a string size 40 of '0' and '1'. Each '0' represents the switch in 'off' position, each '1' represents a switch in 'on' position. Each 'on' switch have an infinite number of lighting bulbs (position times 1, 2, 3, 4, 5.....) connected to this switch. For example in a string 0110000000000000000000000000000000000000 'on' switches are in position 2 and 3 (starting from 1 not from 0), that means that position of bulbs will be for 2 - 2, 4, 6, 8, 10..... and for 3 - 3, 6, 9, 12....... User input the number of position of all the bulbs that are in 'on' position, and program returns number of a bulb at this position. In the previous example sorted bulbs connected to 'on' switches will be 2, 3, 4, 6, 8, 9, 10, 12 (eliminate same numbers), user enter 5, the program returns 8.","distinct":true,"url":"https://api.github.com/repos/nosovairena/Programming-/commits/5cb3567076b9c65abc8acce675f529012ef5b363"}]}
{"actor":{"display_login":"nosovairena"}}