{"published":"2010-08-16 18:16:52","version":"1.0","blog_title":"\u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5","author_url":"https://blog.hatena.ne.jp/peryaudo/","width":"100%","provider_url":"https://hatena.blog","title":"AOJ 0052 Factorial II","type":"rich","url":"https://peryaudo.hatenablog.com/entry/20100816/1281950212","height":"190","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperyaudo.hatenablog.com%2Fentry%2F20100816%2F1281950212\" title=\"AOJ 0052 Factorial II - \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>","description":"404 Not Found #include <cstdio> int main() { int n, a; while(a = 0, scanf(\"%d\\n\", &n), n){ while(n /= 5) a += n; printf(\"%d\\n\", a); } return 0; } \u3059\u3044\u307e\u305b\u3093\u3001\u89e3\u304d\u65b9\u3050\u3050\u308a\u307e\u3057\u305f\u3002 \u968e\u4e57\u306e\u672b\u5c3e\u306e 0 \u306e\u500b\u6570\u6570\u5b66\u7684\u77e5\u8b58\u306f\u4e4f\u3057\u3044\u306e\u3067\u305d\u308c\u305e\u308c\u899a\u3048\u3066\u3044\u304f\u3057\u304b\u306a\u3044\u3002","provider_name":"Hatena Blog","categories":["Programming","Algorithm","AOJ"],"blog_url":"https://peryaudo.hatenablog.com/","author_name":"peryaudo","image_url":null}