{"title":"\u30b9\u30bf\u30c3\u30af","author_url":"https://blog.hatena.ne.jp/pknight/","height":"190","version":"1.0","blog_url":"https://pknight.hatenablog.com/","url":"https://pknight.hatenablog.com/entry/20090704/1246701108","type":"rich","image_url":null,"description":"http://www.geocities.jp/ky_webid/algorithm/008.html\u30c7\u30fc\u30bf\u306e\u6271\u3044\u65b9\u306e\u8a71\u3067\u3059\u304b\u306d\u3002\u7c21\u5358\u306b\u8a00\u3046\u3068\u914d\u5217\u306e\u5f8c\u308d\u306b\u8ffd\u52a0\u3001\u307e\u305f\u5f8c\u308d\u304b\u3089\u524a\u9664\u3001\u3068\u3044\u3046\u611f\u3058\u3067\u3057\u3087\u3046\u304b\u3002\u3068\u308a\u3042\u3048\u305a\u9069\u5f53\u306b\u5b9f\u88c5\u3057\u3066\u307f\u307e\u3059\u3002 #include <stdio.h> typedef struct { int data[100]; int index; } stack; int push (stack *s,int data) { if ( s->index >= 100 ) { return 0; } s->data[s->index++] = data; return 1; } int \u2026","width":"100%","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fpknight.hatenablog.com%2Fentry%2F20090704%2F1246701108\" title=\"\u30b9\u30bf\u30c3\u30af - (void*)P\u306a\u3044\u3068\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"(void*)P\u306a\u3044\u3068","categories":["C","algorithm"],"provider_name":"Hatena Blog","published":"2009-07-04 18:51:48","author_name":"pknight"}