<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>扩展BSGS on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E6%89%A9%E5%B1%95bsgs/</link><description>Recent content in 扩展BSGS on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Fri, 28 Jul 2017 14:23:36 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%89%A9%E5%B1%95bsgs/index.xml" rel="self" type="application/rss+xml"/><item><title>hdu 2815 Mod Tree (扩展BSGS算法)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-07-28-hdu-2815/</link><pubDate>Fri, 28 Jul 2017 14:23:36 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-07-28-hdu-2815/</guid><description>&lt;p&gt;题意：k^D=n(%p),求最小的D  (1&amp;lt;=K, P, N&amp;lt;=10^9)&lt;/p&gt;
&lt;p&gt;思路：出题人英文水平捉鸡。。。。&lt;/p&gt;</description></item><item><title>BZOJ 2480: Spoj3105 Mod (扩展BSGS算法，模板)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-07-24-bzoj-2480/</link><pubDate>Mon, 24 Jul 2017 13:37:40 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-07-24-bzoj-2480/</guid><description>&lt;h2 class="relative group"&gt;Description
 &lt;div id="description" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#description" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;已知数a,p,b，求满足a^x≡b(mod p)的最小自然数x。&lt;/p&gt;</description></item></channel></rss>