{"author_url":"https://blog.hatena.ne.jp/chiwawa_star/","title":"\u518d\u5e30\u3068\u5206\u5272\u7d71\u6cbb\u6cd5\uff5c\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u30c7\u30fc\u30bf\u69cb\u9020","provider_url":"https://hatena.blog","published":"2016-06-07 23:28:26","blog_title":"C++\u7af6\u30d7\u30ed\u5b66\u7fd2\u65e5\u8a18(\u4eee)","url":"https://chiwawa-star.hatenablog.com/entry/2016/06/07/232826","version":"1.0","description":"\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u30c7\u30fc\u30bf\u69cb\u9020 \u7b2c6\u7ae0\u22121\u300c\u518d\u5e30\u3068\u5206\u5272\u7d71\u6cbb\u6cd5\u300d\u3067\u968e\u4e57\u30b3\u30fc\u30c9\u3092\u66f8\u304d\u307e\u3057\u305f\u3002 #include <bits/stdc++.h> #define LL long long #define ULL unsigned long long #define REP(i,n) for(int i=0; i<(n); i++) #define REP2(i,x,n) for(int i=x; i<(n); i++) using namespace std; int func( int n ) { if( n == 1 ) { return 1; } return n * func( n - 1 ); \u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fchiwawa-star.hatenablog.com%2Fentry%2F2016%2F06%2F07%2F232826\" title=\"\u518d\u5e30\u3068\u5206\u5272\u7d71\u6cbb\u6cd5\uff5c\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u30c7\u30fc\u30bf\u69cb\u9020 - C++\u7af6\u30d7\u30ed\u5b66\u7fd2\u65e5\u8a18(\u4eee)\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","type":"rich","image_url":null,"author_name":"chiwawa_star","categories":["\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u30c7\u30fc\u30bf\u69cb\u9020","\u95a2\u6570","\u30b3\u30fc\u30c9"],"provider_name":"Hatena Blog","blog_url":"https://chiwawa-star.hatenablog.com/","height":"190"}