{"description":"\u89e3\u6cd5 \u4e8c\u3064\u306e\u6587\u5b57\u5217\u3092\u9078\u3093\u3067\u3001\u305d\u306e\u3046\u3061\u4e00\u3064\u306e\u533a\u5207\u308b\u4f4d\u7f6e\u3092\u6c7a\u3081\u3066\u53cd\u8ee2\u3055\u305b\u308b\u3002\u3053\u308c\u3068\u4ed6\u65b9\u306e\u6587\u5b57\u5217\u304c\u4e00\u81f4\u3057\u305f\u3089\u30ab\u30a6\u30f3\u30c8\u3059\u308b\u3002 #include<bits/stdc++.h> using namespace std; // rep #define REP(i,a,b) for(int i=a;i<b;i++) #define rep(i,n) REP(i,0,n) class FoxAndWord { public: int howManyPairs(vector <string> words) { int result = 0; rep(i, words.size()-1) { REP(j, i+1,\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140326%2F1395838570\" title=\"SRM604 Div2Easy - FoxAndWord - Logfiles\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","categories":["TopCoder"],"published":"2014-03-26 21:56:10","type":"rich","author_name":"moistx","blog_url":"https://logfiles.hatenablog.com/","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/moistx/","version":"1.0","height":"190","width":"100%","title":"SRM604 Div2Easy - FoxAndWord","image_url":null,"url":"https://logfiles.hatenablog.com/entry/20140326/1395838570","blog_title":"Logfiles","provider_url":"https://hatena.blog"}