{"provider_url":"https://hatena.blog","description":"http://poj.org/problem?id=2531 \u307b\u3046\u3057\u3093 \u30b0\u30e9\u30d5\u306e\u6700\u5927\u30ab\u30c3\u30c8\u3092\u6c42\u3081\u308b\u3002 \u6700\u5927\u30ab\u30c3\u30c8\u3092\u6c42\u3081\u308b\u554f\u984c\u306f\u3001NP\u5b8c\u5168\u554f\u984c\u3089\u3057\u3044 \u72b6\u614b\u65702^20\u3092\u5168\u63a2\u7d22\u3057\u305f \u30bd\u30fc\u30b9 #include<iostream> using namespace std; #define REP(i,a,b) for(i=a; i<b; ++i) #define rep(i,n) REP(i,0,n) int adj[20][20] = {}; inline int lex_next(int x) { int t = (x|(x-1)) + 1; return t | ((((t & -t) / (x \u2026","type":"rich","blog_title":"\u96d1\u8a18","height":"190","url":"https://h-chiro.hatenablog.com/entry/20101103/1288799266","title":" 2531 Network Saboteur","version":"1.0","author_url":"https://blog.hatena.ne.jp/h_chiro/","blog_url":"https://h-chiro.hatenablog.com/","published":"2010-11-03 00:47:46","categories":["PKU"],"image_url":null,"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fh-chiro.hatenablog.com%2Fentry%2F20101103%2F1288799266\" title=\" 2531 Network Saboteur - \u96d1\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_name":"h_chiro","provider_name":"Hatena Blog","width":"100%"}