https://111qqz.com/en/tags/%E7%9F%A9%E9%98%B5%E5%BF%AB%E9%80%9F%E5%B9%82/Recent content in 矩阵快速幂 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzTue, 10 Oct 2017 10:19:55 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-10-hdu-5950/Tue, 10 Oct 2017 10:19:55 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-10-hdu-5950/<p><a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5950" target="_blank" rel="noreferrer">题目链接</a></p> <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>给f[1],f[2],n,f[i] = 2*f[i-2] + f[i-1] + i^4,求f[n]的值。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-uva-10870/Sat, 30 Sep 2017 20:35:55 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-uva-10870/<p><a href="https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;Itemid=8&amp;page=show_problem&amp;problem=1811" target="_blank" rel="noreferrer">uva10870题目链接</a></p> <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>f(n) = a1f(n − 1) + a2f(n − 2) + a3f(n − 3) + . . . + adf(n − d), for n &gt; d</p>https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-hdu-4990/Sat, 30 Sep 2017 11:38:05 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-hdu-4990/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=4990" target="_blank" rel="noreferrer">题目链接</a></p> <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>给出了一段程序，程序实际算的是f[n] = (f[n-1] + n%2)%m的值，其中f[1]=1,给出n,m(1E9)，问f[n]</p>https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-hdu-5015/Sat, 30 Sep 2017 10:54:07 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-hdu-5015/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=5015" target="_blank" rel="noreferrer">hdu5015题目链接</a></p> <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>给出矩阵的构造规则： a[0][j] (j&gt;=1) 分别为233,2333,23333&hellip;.给出a[i][0] (i&gt;=1)，对于其余的i,j,a[i][j]=a[i-1][j] + a[i][j-1]</p>https://111qqz.com/en/post/acm-icpc/2016/2016-10-26-hdu4549/Wed, 26 Oct 2016 09:12:43 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-10-26-hdu4549/<p>题意：M斐波那契数列F[n]是一种整数数列，它的定义如下：</p> <p>F[0] = a F[1] = b F[n] = F[n-1] * F[n-2] ( n &gt; 1 )</p>