{"action":"reopened","issue":{"url":"https://api.github.com/repos/snu-sf-class/PP2015f_TA/issues/111","labels_url":"https://api.github.com/repos/snu-sf-class/PP2015f_TA/issues/111/labels{/name}","comments_url":"https://api.github.com/repos/snu-sf-class/PP2015f_TA/issues/111/comments","events_url":"https://api.github.com/repos/snu-sf-class/PP2015f_TA/issues/111/events","html_url":"https://github.com/snu-sf-class/PP2015f_TA/issues/111","id":116972537,"number":111,"title":"6-7 무한루프","user":{"login":"veritas624","id":14102618,"avatar_url":"https://avatars.githubusercontent.com/u/14102618?v=3","gravatar_id":"","url":"https://api.github.com/users/veritas624","html_url":"https://github.com/veritas624","followers_url":"https://api.github.com/users/veritas624/followers","following_url":"https://api.github.com/users/veritas624/following{/other_user}","gists_url":"https://api.github.com/users/veritas624/gists{/gist_id}","starred_url":"https://api.github.com/users/veritas624/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/veritas624/subscriptions","organizations_url":"https://api.github.com/users/veritas624/orgs","repos_url":"https://api.github.com/users/veritas624/repos","events_url":"https://api.github.com/users/veritas624/events{/privacy}","received_events_url":"https://api.github.com/users/veritas624/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":1,"created_at":"2015-11-15T04:42:14Z","updated_at":"2016-01-25T02:51:31Z","closed_at":null,"body":"6-7에 무한루프가 입력으로 들어올 수 있나요?\r\n무한루프 여부를 확인할 수 있는 알고리즘이 존재하는 것 같은데 이것까지 구현하는 것이 숙제의 의도인지 궁금합니다.\r\n예를 들어 (x := x)*U(x:=2)에 입력이 1이라면 {2}가 결과여야 하나요 구현하지 않아도 되나요?"}}