{"url":"https://kujira16.hateblo.jp/entry/2013/03/18/210931","width":"100%","blog_url":"https://kujira16.hateblo.jp/","height":"190","author_name":"kujira16","blog_title":"\u304f\u3058\u3089\u306b\u3063\u304d++","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkujira16.hateblo.jp%2Fentry%2F2013%2F03%2F18%2F210931\" title=\"Codeforces Round #174 Div2 - \u304f\u3058\u3089\u306b\u3063\u304d++\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","title":"Codeforces Round #174 Div2","version":"1.0","type":"rich","categories":["Codeforces"],"author_url":"https://blog.hatena.ne.jp/kujira16/","provider_name":"Hatena Blog","image_url":null,"description":"A. Cows and Primitive Roots http://www.codeforces.com/problemset/problem/284/A \u7d20\u6570p\u306b\u3064\u3044\u3066 x - 1, x2 - 1, ..., xp-2 - 1 (mod p) != 0 \u304b\u3064 xp-1 (mod p) == 0 \u304c\u6210\u308a\u7acb\u3064x (1 <= x < p) \u3092\u3001p\u306ePrimitive Root\u3068\u3044\u3044\u307e\u3059\u3002\u65e5\u672c\u8a9e\u3067\u306f\u300c\u539f\u59cb\u6839\u300d\u3068\u3044\u3044\u307e\u3059\u3002 \u7d20\u6570p\u3092\u4e0e\u3048\u308b\u306e\u3067\u3001\u539f\u59cb\u6839\u306e\u500b\u6570\u3092\u8868\u793a\u3057\u3066\u4e0b\u3055\u3044\u3002 \u539f\u59cb\u6839\u306b\u3064\u3044\u3066\u306e\u89e3\u8aac\u306f\u3053\u3061\u3089\u304c\u8a73\u3057\u3044\u3067\u3059\u3002\u304c\u3001\u9ad8\u5ea6\u3059\u304e\u3066\u79c1\u306b\u306f\u3055\u3063\u3071\u308a\u7406\u89e3\u51fa\u6765\u307e\u305b\u3093^^; \u65e2\u7d04\u5270\u4f59\u985e\u7fa4\u3068\u539f\u59cb\u6839 - epii\u2026","published":"2013-03-18 21:09:31","provider_url":"https://hatena.blog"}