{"author_url":"https://blog.hatena.ne.jp/tanakaBox/","description":"\u7591\u4f3c\u4e71\u6570\u304c\u3053\u3093\u306a\u306b\u5358\u7d14\u306a\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3067\u51fa\u6765\u3066\u3044\u308b\u3068\u306f\u30fb\u30fb\u30fb\u3002\u3082\u3063\u3068\u5358\u7d14\u306b\u3057\u3066\u307f\u305f\u3002 \u9069\u5f53\u306aa\u3001p\u3001q\u3092\u9078\u3093\u3067\u3001ap + q = a'\u3068\u3059\u308b\u3002\u6b21\u306ba'\u3092a\u306b\u4ee3\u5165\u3059\u308b\u3002\u3067\u3001\u4f59\u308a\u3092\u53d6\u308b\u3002\u5f8c\u306f\u30cb\u30e5\u30fc\u30c8\u30f3\u6cd5\u306e\u3088\u3046\u306b\u7e70\u308a\u8fd4\u3059\u3060\u3051\u3002 #include <stdio.h> #include <stdlib.h> unsigned long int next = 1; #define RAND_MAX_COPY 10 int rand_copy(void) { next = next * 3 + 1; return (unsigned int) next % RAND_MAX_COPY; } int main(\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fboxnos.hatenablog.com%2Fentry%2F20070811%2F1186835214\" title=\" K&amp;R\u3092\u8aad\u3082\u3046(26) rand\u306e\u5199\u7d4c\u3002 - \u30dc\u30af\u30ce\u30b9\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","published":"2007-08-11 21:26:54","height":"190","author_name":"tanakaBox","version":"1.0","type":"rich","width":"100%","title":" K&R\u3092\u8aad\u3082\u3046(26) rand\u306e\u5199\u7d4c\u3002","provider_url":"https://hatena.blog","image_url":null,"blog_title":"\u30dc\u30af\u30ce\u30b9","blog_url":"https://boxnos.hatenablog.com/","url":"https://boxnos.hatenablog.com/entry/20070811/1186835214","categories":["GCC"]}