https://111qqz.com/en/tags/bsgs/Recent content in BSGS on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzFri, 28 Jul 2017 14:23:36 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-07-28-hdu-2815/Fri, 28 Jul 2017 14:23:36 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-07-28-hdu-2815/<p>题意：k^D=n(%p),求最小的D  (1&lt;=K, P, N&lt;=10^9)</p> <p>思路：出题人英文水平捉鸡。。。。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-07-24-bzoj-2480/Mon, 24 Jul 2017 13:37:40 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-07-24-bzoj-2480/<h2 class="relative group">Description <div id="description" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#description" aria-label="Anchor">#</a> </span> </h2> <p>已知数a,p,b，求满足a^x≡b(mod p)的最小自然数x。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-07-23-bsgs-algorithm-notes/Sun, 23 Jul 2017 12:41:46 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-07-23-bsgs-algorithm-notes/<p><strong>离散对数</strong>（Discrete Logarithm）问题是这样一个问题，它是对于模方程</p>https://111qqz.com/en/post/acm-icpc/2017/2017-07-23-poj-2417/Sun, 23 Jul 2017 12:13:28 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-07-23-poj-2417/<p><a href="http://poj.org/problem?id=2417" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：</p> <p>Given a prime P, 2 &lt;= P &lt; 231, an integer B, 2 &lt;= B &lt; P, and an integer N, 1 &lt;= N &lt; P, compute the discrete logarithm of N, base B, modulo P. That is, find an integer L such that BL == N (mod P)</p>