{"action":"opened","issue":{"url":"https://api.github.com/repos/Jiaoyangx110/rep01/issues/1","repository_url":"https://api.github.com/repos/Jiaoyangx110/rep01","labels_url":"https://api.github.com/repos/Jiaoyangx110/rep01/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/Jiaoyangx110/rep01/issues/1/comments","events_url":"https://api.github.com/repos/Jiaoyangx110/rep01/issues/1/events","html_url":"https://github.com/Jiaoyangx110/rep01/issues/1","id":391935974,"node_id":"MDU6SXNzdWUzOTE5MzU5NzQ=","number":1,"title":"test","user":{"login":"Haari237","id":37784658,"node_id":"MDQ6VXNlcjM3Nzg0NjU4","avatar_url":"https://avatars0.githubusercontent.com/u/37784658?v=4","gravatar_id":"","url":"https://api.github.com/users/Haari237","html_url":"https://github.com/Haari237","followers_url":"https://api.github.com/users/Haari237/followers","following_url":"https://api.github.com/users/Haari237/following{/other_user}","gists_url":"https://api.github.com/users/Haari237/gists{/gist_id}","starred_url":"https://api.github.com/users/Haari237/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Haari237/subscriptions","organizations_url":"https://api.github.com/users/Haari237/orgs","repos_url":"https://api.github.com/users/Haari237/repos","events_url":"https://api.github.com/users/Haari237/events{/privacy}","received_events_url":"https://api.github.com/users/Haari237/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-12-17T23:41:21Z","updated_at":"2018-12-17T23:41:21Z","closed_at":null,"author_association":"NONE","body":"Programming Test\r\n\r\n\r\nPut N blocks into a lattice of N x N such that neighbouring rows or columns should have at least a pair of blocks that share an edge or a vertex.\r\nFor example, if we have 5 blocks, the following arrangements are allowed:\r\n\r\n\r\n               Arrangement A\r\n\r\n\r\n             Arrangement B\r\n\r\n\r\n\r\n            Arrangement C\r\n\r\n\r\n\r\nThe following arrangement is not allowed:\r\n            \r\n\r\n\r\n    Arrangement D  (Not allowed)\r\n            \r\n\r\nTwo arrangements are considered the same if they turn into each other by rotating or if they are mirror or each other.  For example, the following arrangements are the same as Arrangement B.\r\n\r\n\r\n      Arrangement B’\r\n\r\n\r\n     Arrangement B’’\r\n\r\n\r\nWrite a program to print out total number of allowable arrangements for a particular number N, and print out all the allowable arrangements with each block represented by a ‘#’.  For example, for number 3, the program output can be:\r\n       Please enter number of blocks: \r\n       Total number of allowable arrangements are 5.\r\n       The allowable arrangements are:\r\n\r\n        ###   \r\n               \r\n        #\r\n          ##\r\n\r\n\r\n         #\r\n         ##\r\n\r\n           \r\n         #\r\n           #        \r\n             #\r\n\r\n         #  #\r\n           #\r\n\r\nThe program can have a restriction on the maximum value of N. The program should be written in C++, and can be compiled into an executable file, and can then be run in a Windows Command prompt window, or in a Linux shell.  Only the source code of the program needs to be submitted.\r\n"}}
{"actor":{"display_login":"Haari237"}}