{"type":"rich","url":"https://kankinkon.hatenadiary.org/entry/20120104/1325665382","blog_url":"https://kankinkon.hatenadiary.org/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkankinkon.hatenadiary.org%2Fentry%2F20120104%2F1325665382\" title=\"\u57fa\u672c\u30c7\u30fc\u30bf\u69cb\u9020 \u30ea\u30b9\u30c8 - Afro-Blue\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","height":"190","author_url":"https://blog.hatena.ne.jp/kankinkon/","version":"1.0","published":"2012-01-04 17:23:02","width":"100%","author_name":"kankinkon","description":"\u4f8b\u984c3.9 \u5faa\u74b0\u30ea\u30b9\u30c8\u3092\u7528\u3044\u3066\u30b8\u30e7\u30bb\u30d5\u30a1\u30b9\u9078\u6319\u3092\u884c\u3046 #include <stdio.h> #include <stdlib.h> typedef struct NODE { int item; struct NODE *next; } Node; Node *link; int main(int argc, char *argv[]) { int i; int N = atoi(argv[1]); int M = atoi(argv[2]); Node *t = malloc(sizeof(*t)); Node *x = t; t->item = 1; t->next = t; for (i\u2026","image_url":null,"title":"\u57fa\u672c\u30c7\u30fc\u30bf\u69cb\u9020 \u30ea\u30b9\u30c8","provider_name":"Hatena Blog","categories":["\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u30c7\u30fc\u30bf\u69cb\u9020"],"blog_title":"Afro-Blue","provider_url":"https://hatena.blog"}