{"blog_title":"\u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5","width":"100%","provider_name":"Hatena Blog","published":"2010-08-16 19:22:24","title":"AOJ 0028 Mode Value","author_url":"https://blog.hatena.ne.jp/peryaudo/","height":"190","image_url":null,"description":"404 Not Found #include <cstdio> #include <map> #include <vector> #include <algorithm> using namespace std; int main() { map <int, int> m; map <int, vector<int> > l; int n; while(~scanf(\"%d\\n\", &n)) m[n]++; for(map<int, int>::iterator it = m.begin(); it != m.end(); it++) l[(*it).second].push_back((*i\u2026","categories":["Programming","Algorithm","AOJ"],"version":"1.0","provider_url":"https://hatena.blog","type":"rich","blog_url":"https://peryaudo.hatenablog.com/","author_name":"peryaudo","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperyaudo.hatenablog.com%2Fentry%2F20100816%2F1281954144\" title=\"AOJ 0028 Mode Value - \u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","url":"https://peryaudo.hatenablog.com/entry/20100816/1281954144"}