https://111qqz.com/en/tags/%E4%BA%8C%E6%AC%A1%E5%89%A9%E4%BD%99/Recent content in 二次剩余 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzWed, 18 Oct 2017 05:38:43 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-look-for-loop-section-in-generalized-fibonacci-sequence/Wed, 18 Oct 2017 05:38:43 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-look-for-loop-section-in-generalized-fibonacci-sequence/<p>**问题：**给定<figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://img.blog.csdn.net/20140512141202250" ></figure> ，满足<figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://img.blog.csdn.net/20140512141344500" ></figure> ，求<figure><img class="my-0 rounded-md" loading="lazy" decoding="async" fetchpriority="low" alt="" src="http://img.blog.csdn.net/20140512141547343" ></figure> 的循</p> <p>环节长度。</p> <p>原理见<a href="http://blog.csdn.net/acdreamers/article/details/25616461" target="_blank" rel="noreferrer">广义Fibonacci数列找循环节</a></p> <p>这里只说做法</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-13-hdu-4794/Fri, 13 Oct 2017 12:23:49 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-13-hdu-4794/<h1 class="relative group">题意： <div id="题意" 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="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>给定一个 N∗N(N≤4e9) 的矩阵，现在经过这样一个变换：将 (x,y) 变为 ((x+y)%N,(x+2×y)%N)(0≤x&lt;N,0≤y&lt;N) 现在求经过多少次这样的变换之后在回到 N∗N 的原始矩阵。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-10-30-hdu-3977/Sun, 30 Oct 2016 21:01:37 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-10-30-hdu-3977/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=3977" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：f[0] = 1,f[1] = 1,f[i] = f[i-1] + f[i-2] (i&gt;=2)，问最小的m满足f[n]%p==f[n+m]%p</p>https://111qqz.com/en/post/acm-icpc/2016/2016-10-10-e4ba8ce6aca1e589a9e4bd99efbc88cipollas-algorithmefbc89e5ada6e4b9a0e7ac94e8aeb0/Mon, 10 Oct 2016 12:08:41 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-10-10-e4ba8ce6aca1e589a9e4bd99efbc88cipollas-algorithmefbc89e5ada6e4b9a0e7ac94e8aeb0/<p>先放资料。</p> <hr> <h3 class="relative group"><strong>前置技能点：</strong> <div id="前置技能点" 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="#%e5%89%8d%e7%bd%ae%e6%8a%80%e8%83%bd%e7%82%b9" aria-label="Anchor">#</a> </span> </h3> <p><a href="http://baike.baidu.com/link?url=7nEL8QRUFHmQQor4elIUVpLVJG0i63Q3iRRXhrzzr1p2bhJ4qq4d-whxKrZhx6O8GEBf_iv_wsM2bWH1NJaJDVyLM8Mft0PCPAhMnYj6eNG2zh4lTNt5YvGDn1R4vrYE" target="_blank" rel="noreferrer">剩余系</a></p>