{"url":"https://eromog.hatenablog.com/entry/2014/09/15/025211","provider_url":"https://hatena.blog","provider_name":"Hatena Blog","version":"1.0","description":"\u306f\u3044\u3002 http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_7_B 1 \u304b\u3089 n \u307e\u3067\u306e\u6570\u306e\u4e2d\u304b\u3089\u3001\u91cd\u8907\u7121\u3057\u3067\uff13\u3064\u306e\u6570\u3092\u9078\u3073\u305d\u308c\u3089\u306e\u5408\u8a08\u304c x \u3068\u306a\u308b\u7d44\u307f\u5408\u308f\u305b\u306e\u6570\u3092\u6c42\u3081\u308b \u3068\u3044\u3046\u306e\u30673\u91cd\u30eb\u30fc\u30d7\u3067\u66f8\u3044\u3066\u3044\u305f\u306e\u3060\u304c\u4ed6\u306e\u4eba\u306e\u56de\u7b54\u3092\u898b\u305f\u30892\u91cd\u30eb\u30fc\u30d7\u306b\u51fa\u6765\u308b\u65b9\u6cd5\u304c\u3042\u3063\u3066\u611f\u52d5\u3057\u305f\u306e\u3067\u66f8\u3044\u3066\u304a\u304f\u3053\u3068\u306b\u3002 \u30fb3\u91cd\u30eb\u30fc\u30d7\u306e\u5834\u5408 for i in range(1,n-1): for j in range(i+1,n): for k in range(j+1,n+1): if i+j+k==x:ans+=1 print ans 2\u91cd\u30013\u91cd\u304ci\u2026","published":"2014-09-15 02:52:11","categories":["aoj"],"blog_url":"https://eromog.hatenablog.com/","author_url":"https://blog.hatena.ne.jp/clarinet758/","width":"100%","title":"Structured Program II - How many ways?","type":"rich","image_url":null,"height":"190","blog_title":"\u2665\uff9f*:;\u604b\u306e\u56e0\u6570\u5206\u89e3;:*\uff9f\u2665","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Feromog.hatenablog.com%2Fentry%2F2014%2F09%2F15%2F025211\" title=\"Structured Program II - How many ways? - \u2665\uff9f*:;\u604b\u306e\u56e0\u6570\u5206\u89e3;:*\uff9f\u2665\" 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":"clarinet758"}