{"author_url":"https://blog.hatena.ne.jp/moistx/","blog_title":"Logfiles","width":"100%","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140824%2F1408904259\" title=\"yukicoder no.16 - Logfiles\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_url":"https://logfiles.hatenablog.com/","height":"190","url":"https://logfiles.hatenablog.com/entry/20140824/1408904259","image_url":null,"author_name":"moistx","version":"1.0","published":"2014-08-24 03:17:39","title":"yukicoder no.16","type":"rich","description":"\u554f\u984c\u6587 http://ch.nicovideo.jp/programing/blomaga/ar604305\u89e3\u6cd5\uff11 \u7e70\u308a\u8fd4\u3057\u4e8c\u4e57\u6cd5\u3092\u9069\u7528\u3059\u308b\u3002 #include <iostream> #include <algorithm> using namespace std; typedef unsigned long long ull; #define MOD (1000003) ull pow(ull x, ull n) { if(n == 0) return 1; ull ret = pow(x*x%MOD, n/2); if(n&1) (ret *= x) %= MOD; return ret;\u2026","categories":["yukicoder"],"provider_url":"https://hatena.blog"}