{"type":"rich","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fishikuro.hateblo.jp%2Fentry%2F20071008%2F1191842182\" title=\"1-17.c - N=1\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_name":"ishn","title":"1-17.c","blog_url":"https://ishikuro.hateblo.jp/","version":"1.0","provider_url":"https://hatena.blog","blog_title":"N=1","published":"2007-10-08 20:16:22","categories":["K&R2Exercise"],"width":"100%","url":"https://ishikuro.hateblo.jp/entry/20071008/1191842182","image_url":null,"description":"\u6f14\u7fd2 1-17 80\u5b57\u3088\u308a\u9577\u3044\u884c\u3092\u5168\u3066\u5370\u5b57\u3059\u308b\u30d7\u30ed\u30b0\u30e9\u30e0\u3092\u66f8\u3051\u3002 #include <stdio.h> #define LENGTHNOTPRINT 80 main() { int c, i, j; int cache[LENGTHNOTPRINT]; i = 0; while ((c = getchar()) != EOF) { ++i; if (i <= LENGTHNOTPRINT) cache[i-1] = c; if (i == LENGTHNOTPRINT+1) { for (j = 0; j < LENGTHNOTPRINT; ++j) putchar(cache[j]); } \u2026","height":"190","author_url":"https://blog.hatena.ne.jp/ishn/"}