{"categories":[],"blog_url":"https://nodchip.hatenadiary.org/","provider_url":"https://hatena.blog","image_url":null,"author_name":"nodchip","type":"rich","published":"2010-05-06 22:35:55","blog_title":"nodchip\u306e\u65e5\u8a18","width":"100%","description":"\u4e26\u3079\u304b\u3048\u3089\u308c\u305f\u6587\u5b57\u5217\u306f\u30bd\u30fc\u30c8\u3057\u3066\u6bd4\u8f03\u3059\u308b\u3068\u826f\u3044 \u77ed\u3044\u6587\u5b57\u5217\u3092\u30bd\u30fc\u30c8\u3057\u3088\u3046\u3068\u3057\u3066RE\u3092\u3082\u3089\u3063\u3066\u3057\u307e\u3063\u305f\u30fb\u30fb\u30fb int main() { int n; cin >> n; for (int caseIndex = 1; caseIndex <= n; ++caseIndex) { map<string, int> dic; int m; cin >> m; for (int i = 0; i < m; ++i) { string s; cin >> s; if (s.size() >= 4) { sort(s.begin() + 1, s.end() - 1); } ++dic[s]; } cin\u2026","author_url":"https://blog.hatena.ne.jp/nodchip/","version":"1.0","title":"PKU 2493 Rdeaalbe","provider_name":"Hatena Blog","height":"190","url":"https://nodchip.hatenadiary.org/entry/20100506/1273152955","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fnodchip.hatenadiary.org%2Fentry%2F20100506%2F1273152955\" title=\"PKU 2493 Rdeaalbe - nodchip\u306e\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}