{"type":"rich","blog_title":"Logfiles","provider_name":"Hatena Blog","version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140902%2F1409668996\" title=\"UVa382 Perfection - 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/","provider_url":"https://hatena.blog","url":"https://logfiles.hatenablog.com/entry/20140902/1409668996","image_url":null,"categories":["UVa"],"description":"\u554f\u984c \u5b8c\u5168\u6570\u304b\u3069\u3046\u304b\u3092\u5224\u5b9a\u3059\u308b\u554f\u984c\u3002AOJ \u306b\u3082 AtCoder Beginner Contest \u306b\u3082\u307b\u307c\u540c\u3058\u554f\u984c\u304c\u3042\u308b\u3002 #include <cstdio> using namespace std; int main() { int N; puts(\"PERFECTION OUTPUT\"); while(scanf(\"%d\", &N) && N) { printf(\"%5d \", N); int sum = 0; for(int i=1; i*i<N; i++) { if(N % i == 0) { sum += i; sum += N/i; } } sum -= N; if(sum < \u2026","width":"100%","author_url":"https://blog.hatena.ne.jp/moistx/","published":"2014-09-02 23:43:16","height":"190","author_name":"moistx","title":"UVa382 Perfection"}