{"action":"created","issue":{"url":"https://api.github.com/repos/TakeumiYamamura/programming_contest/issues/4","repository_url":"https://api.github.com/repos/TakeumiYamamura/programming_contest","labels_url":"https://api.github.com/repos/TakeumiYamamura/programming_contest/issues/4/labels{/name}","comments_url":"https://api.github.com/repos/TakeumiYamamura/programming_contest/issues/4/comments","events_url":"https://api.github.com/repos/TakeumiYamamura/programming_contest/issues/4/events","html_url":"https://github.com/TakeumiYamamura/programming_contest/issues/4","id":181207654,"number":4,"title":"AtCoder Beginner Contest 032","user":{"login":"TakeumiYamamura","id":7766684,"avatar_url":"https://avatars.githubusercontent.com/u/7766684?v=3","gravatar_id":"","url":"https://api.github.com/users/TakeumiYamamura","html_url":"https://github.com/TakeumiYamamura","followers_url":"https://api.github.com/users/TakeumiYamamura/followers","following_url":"https://api.github.com/users/TakeumiYamamura/following{/other_user}","gists_url":"https://api.github.com/users/TakeumiYamamura/gists{/gist_id}","starred_url":"https://api.github.com/users/TakeumiYamamura/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/TakeumiYamamura/subscriptions","organizations_url":"https://api.github.com/users/TakeumiYamamura/orgs","repos_url":"https://api.github.com/users/TakeumiYamamura/repos","events_url":"https://api.github.com/users/TakeumiYamamura/events{/privacy}","received_events_url":"https://api.github.com/users/TakeumiYamamura/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/TakeumiYamamura/programming_contest/labels/dynamic%20programming","name":"dynamic programming","color":"1d76db"}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":2,"created_at":"2016-10-05T16:46:19Z","updated_at":"2016-10-06T06:53:57Z","closed_at":null,"body":"http://abc032.contest.atcoder.jp/"},"comment":{"url":"https://api.github.com/repos/TakeumiYamamura/programming_contest/issues/comments/251881683","html_url":"https://github.com/TakeumiYamamura/programming_contest/issues/4#issuecomment-251881683","issue_url":"https://api.github.com/repos/TakeumiYamamura/programming_contest/issues/4","id":251881683,"user":{"login":"TakeumiYamamura","id":7766684,"avatar_url":"https://avatars.githubusercontent.com/u/7766684?v=3","gravatar_id":"","url":"https://api.github.com/users/TakeumiYamamura","html_url":"https://github.com/TakeumiYamamura","followers_url":"https://api.github.com/users/TakeumiYamamura/followers","following_url":"https://api.github.com/users/TakeumiYamamura/following{/other_user}","gists_url":"https://api.github.com/users/TakeumiYamamura/gists{/gist_id}","starred_url":"https://api.github.com/users/TakeumiYamamura/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/TakeumiYamamura/subscriptions","organizations_url":"https://api.github.com/users/TakeumiYamamura/orgs","repos_url":"https://api.github.com/users/TakeumiYamamura/repos","events_url":"https://api.github.com/users/TakeumiYamamura/events{/privacy}","received_events_url":"https://api.github.com/users/TakeumiYamamura/received_events","type":"User","site_admin":false},"created_at":"2016-10-06T06:53:57Z","updated_at":"2016-10-06T06:53:57Z","body":"## D - ナップサック問題\r\n時間制限 : 2sec / メモリ制限 : 512MB\r\n\r\n### 問題文\r\n0/1ナップサック問題を解いてください。0/1ナップサック問題とは以下のような問題のことです。\r\n\r\nN 個の荷物があり、i(1≦i≦N) 番目の荷物には価値 vi と重さ wi が割り当てられている。\r\n許容重量 W のナップサックが1つある。\r\n重さの和が W 以下となるように荷物の集合を選びナップサックに詰め込むとき、価値の和の最大値を求めよ。ただし、同じ荷物は一度しか選ぶことができない。\r\n"}}
{"actor":{"display_login":"TakeumiYamamura"}}