POJ - 1284- Primitive Roots（数论——原根个数）
摘要：
Problem POJ - 1284- Primitive Roots Time Limit: 1000 mSec Problem Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p 阅读全文
posted @ 2019-05-08 22:49 随缘&不屈 阅读(503) 评论(0) 推荐(0) 编辑
