<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>矩阵 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E7%9F%A9%E9%98%B5/</link><description>Recent content in 矩阵 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Mon, 02 Oct 2017 02:24:09 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E7%9F%A9%E9%98%B5/index.xml" rel="self" type="application/rss+xml"/><item><title>codeforces 385 E. Bear in the Field (先记录想法）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-02-codeforces-div2-385e/</link><pubDate>Mon, 02 Oct 2017 02:24:09 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-02-codeforces-div2-385e/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/problemset/problem/385/E" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" 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="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;有一只熊，初始在(sx,sy)处，如果当前的位置在(x,y)，那么下一秒会在((x+dx-1)%n+1,(y+dy-1)%n+1)处， dx[i] = k[i-1] + dx[i-1],dy[i]=k[i-1] + dy[i-1]，k表示的是某个点的花丛数目。&lt;/p&gt;</description></item><item><title>UVA - 10518 How Many Calls? (构造矩阵，快速幂)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-01-uva-10518/</link><pubDate>Sun, 01 Oct 2017 11:10:16 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-01-uva-10518/</guid><description>&lt;p&gt;&lt;a href="https://vjudge.net/contest/188289#problem/O" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" 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="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;求f[n] = f[n-1] + f[n-2] + 1，在b(10000)进制下的最后一位数字的十进制表示。&lt;/p&gt;</description></item><item><title>hdu 4686 Arc of Dream (构造矩阵，快速幂)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-01-hdu-4686/</link><pubDate>Sun, 01 Oct 2017 06:33:48 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-01-hdu-4686/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4686" target="_blank" rel="noreferrer"&gt;hdu4686题目链接&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" 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="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;An Arc of Dream is a curve defined by following function:&lt;/p&gt;</description></item><item><title>uva 10870 - Recurrences (矩阵加速线性递推式)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-uva-10870/</link><pubDate>Sat, 30 Sep 2017 20:35:55 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-uva-10870/</guid><description>&lt;p&gt;&lt;a href="https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid=8&amp;amp;page=show_problem&amp;amp;problem=1811" target="_blank" rel="noreferrer"&gt;uva10870题目链接&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" 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="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;f(n) = a1f(n − 1) + a2f(n − 2) + a3f(n − 3) + . . . + adf(n − d), for n &amp;gt; d&lt;/p&gt;</description></item><item><title>uva 10655 - Contemplation! Algebra （构造矩阵，快速幂）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-uva-10655/</link><pubDate>Sat, 30 Sep 2017 19:40:15 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-09-30-uva-10655/</guid><description>&lt;p&gt;&lt;a href="https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid=8&amp;amp;page=show_problem&amp;amp;problem=1596" target="_blank" rel="noreferrer"&gt;uva10655题目链接&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" 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="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;给出a+b和ab的值，问a^n+b^n&lt;/p&gt;</description></item><item><title>【dp专题001】bzoj 1009: [HNOI2008]GT考试 (字符串上dp+kmp+矩阵加速线性递推式)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-11-13-bzoj-1009/</link><pubDate>Sun, 13 Nov 2016 07:21:02 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-11-13-bzoj-1009/</guid><description>&lt;h2 class="relative group"&gt;1009: [HNOI2008]GT考试
 &lt;div id="1009-hnoi2008gt考试" 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="#1009-hnoi2008gt%e8%80%83%e8%af%95" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 1 Sec  Memory Limit: 162 MB
Submit: 3127  Solved: 1926
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=1009" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=1009" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=1009" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>acdream oj 1124 喵喵的遗憾 (斐波那契数列循环节)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-11-03-acdream-oj-1124-e596b5e596b5e79a84e98197e686be-e69690e6b3a2e982a3e5a591e695b0e58897e5beaae78eafe88a82/</link><pubDate>Thu, 03 Nov 2016 00:39:54 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-11-03-acdream-oj-1124-e596b5e596b5e79a84e98197e686be-e69690e6b3a2e982a3e5a591e695b0e58897e5beaae78eafe88a82/</guid><description>&lt;p&gt;&lt;a href="http://acdream.info/problem?pid=1124" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：&lt;/p&gt;
&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt=""
 src="http://acdream.info/img/prob/1124/1.jpeg"
 &gt;&lt;/figure&gt;
&lt;p&gt;F0 = 1 , F1 = 1 , F2 = 2 , Fn = Fn-1+Fn-2&lt;/p&gt;
&lt;p&gt;求：&lt;/p&gt;
&lt;p&gt;FFFn Mod P&lt;/p&gt;
&lt;p&gt;( 也就是 F[ F[ F[n] ] ]  % P )&lt;/p&gt;</description></item><item><title>hdu 4291 A Short problem (矩阵快速幂+广义斐波那契循环节||暴力找循环节)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-31-hdu-4291/</link><pubDate>Mon, 31 Oct 2016 08:59:53 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-31-hdu-4291/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4291" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：&lt;/p&gt;
&lt;p&gt;Given n (1 &amp;lt;= n &amp;lt;= 1018), You should solve for&lt;/p&gt;
&lt;p&gt;g(g(g(n))) mod 109 + 7
where&lt;/p&gt;
&lt;p&gt;g(n) = 3g(n - 1) + g(n - 2)&lt;/p&gt;
&lt;p&gt;g(1) = 1&lt;/p&gt;</description></item><item><title>hdu 1005 Number Sequence (矩阵快速幂加速线性递推式)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-30-hdu-1005/</link><pubDate>Sun, 30 Oct 2016 21:18:36 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-30-hdu-1005/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=1005" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：A number sequence is defined as follows:&lt;/p&gt;
&lt;p&gt;f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.&lt;/p&gt;</description></item><item><title>hdu 3221 Brute-force Algorithm (矩阵快速幂+指数循环节)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-30-hdu-3221/</link><pubDate>Sun, 30 Oct 2016 16:45:32 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-30-hdu-3221/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=3221" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出了一段伪代码。分析得知其实就是f[1]= a,f[2] = b,f[n]=f[n-1] * f[n-2]&lt;/p&gt;</description></item><item><title>BZOJ 4547: Hdu5171 小奇的集合 (矩阵快速幂)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-26-bzoj-4547-hdu5171-e5b08fe5a587e79a84e99b86e59088-e79fa9e998b5e5bfabe9809fe5b982/</link><pubDate>Wed, 26 Oct 2016 01:09:38 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-26-bzoj-4547-hdu5171-e5b08fe5a587e79a84e99b86e59088-e79fa9e998b5e5bfabe9809fe5b982/</guid><description>&lt;h2 class="relative group"&gt;4547: Hdu5171 小奇的集合
 &lt;div id="4547-hdu5171-小奇的集合" 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="#4547-hdu5171-%e5%b0%8f%e5%a5%87%e7%9a%84%e9%9b%86%e5%90%88" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 2 Sec  Memory Limit: 256 MB
Submit: 263  Solved: 113
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=4547" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=4547" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=4547" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>hdu 5171 GTY's birthday gift (矩阵快速幂)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-25-hdu-5171-gtys-birthday-gift-e79fa9e998b5e5bfabe9809fe5b982/</link><pubDate>Tue, 25 Oct 2016 10:56:10 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-25-hdu-5171-gtys-birthday-gift-e79fa9e998b5e5bfabe9809fe5b982/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=5171" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n,k，以及n个正数，把n个数放在一个集合里，进行k次操作，每次操作取最大的数和次大的数放进集合。问k次操作结束后，集合中所有数的和。&lt;/p&gt;</description></item><item><title>hdu 4965 Fast Matrix Calculation (矩阵快速幂，2014多校#9)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-19-hdu-4965-fast-matrix-calculation-e79fa9e998b5e5bfabe9809fe5b982efbc8c2014e5a49ae6a0a19/</link><pubDate>Wed, 19 Oct 2016 20:54:11 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-19-hdu-4965-fast-matrix-calculation-e79fa9e998b5e5bfabe9809fe5b982efbc8c2014e5a49ae6a0a19/</guid><description>&lt;p&gt;题目链接&lt;/p&gt;
&lt;p&gt;题意：Step 1: Calculate a new N&lt;em&gt;N matrix C = A&lt;/em&gt;B.
Step 2: Calculate M = C^(N*N).
Step 3: For each element x in M, calculate x % 6. All the remainders form a new matrix M’.
Step 4: Calculate the sum of all the elements in M’.&lt;/p&gt;</description></item><item><title>hdu 2157 How many ways?? (矩阵快速幂经典题目)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-19-hdu-2157/</link><pubDate>Wed, 19 Oct 2016 12:36:20 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-19-hdu-2157/</guid><description>&lt;p&gt;题意：&lt;strong&gt;给定一个有向图，问从A点恰好走k步（允许重复经过边）到达B点的方案数mod p的值&lt;/strong&gt;&lt;/p&gt;</description></item><item><title>poj 3233 Matrix Power Series （矩阵快速幂+分治）</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-19-poj-3233/</link><pubDate>Wed, 19 Oct 2016 08:17:04 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-19-poj-3233/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3233" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：&lt;/p&gt;
&lt;p&gt;Given a &lt;em&gt;n&lt;/em&gt; × &lt;em&gt;n&lt;/em&gt; matrix &lt;em&gt;A&lt;/em&gt; and a positive integer &lt;em&gt;k&lt;/em&gt;, find the sum &lt;em&gt;S&lt;/em&gt; = &lt;em&gt;A&lt;/em&gt; + _A_2 + _A_3 + … + &lt;em&gt;Ak&lt;/em&gt;.&lt;/p&gt;
&lt;p&gt;思路： 对k进行二分。&lt;/p&gt;</description></item><item><title>poj 3070 Fibonacci (矩阵加速线性递推式)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-17-poj-3070-fibonacci/</link><pubDate>Mon, 17 Oct 2016 18:36:15 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-17-poj-3070-fibonacci/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3070" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：求f[n] % 10000,f为斐波那契数。&lt;/p&gt;
&lt;p&gt;思路：按照题目给出的公式，或者按照加速线性递推式的方法都可以。。。&lt;/p&gt;</description></item><item><title>矩阵加速线性递推式（转载）</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-17-e79fa9e998b5e58aa0e9809fe7babfe680a7e98092e68ea8e5bc8fefbc88e8bdace8bdbdefbc89/</link><pubDate>Mon, 17 Oct 2016 17:38:36 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-17-e79fa9e998b5e58aa0e9809fe7babfe680a7e98092e68ea8e5bc8fefbc88e8bdace8bdbdefbc89/</guid><description>&lt;p&gt;找到了篇四年前空间中的旧文，也是有点感动2333.&lt;/p&gt;
&lt;!-- more --&gt;

&lt;h2 class="relative group"&gt;快速求解多项递推式
 &lt;div id="快速求解多项递推式" 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="#%e5%bf%ab%e9%80%9f%e6%b1%82%e8%a7%a3%e5%a4%9a%e9%a1%b9%e9%80%92%e6%8e%a8%e5%bc%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;问题描述:&lt;/p&gt;</description></item><item><title>矩阵学习笔记</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-10-17-e79fa9e998b5e5ada6e4b9a0e7ac94e8aeb0/</link><pubDate>Mon, 17 Oct 2016 17:03:16 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-10-17-e79fa9e998b5e5ada6e4b9a0e7ac94e8aeb0/</guid><description>&lt;p&gt;参考资料：&lt;/p&gt;
&lt;p&gt;&lt;a href="http://www.matrix67.com/blog/archives/276" target="_blank" rel="noreferrer"&gt;十个利用矩阵乘法解决的经典题目&lt;/a&gt;&lt;/p&gt;</description></item><item><title>hdu 1575 Tr A （矩阵快速幂模板题）</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-02-21-hdu1575/</link><pubDate>Sun, 21 Feb 2016 03:21:51 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-02-21-hdu1575/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=1575" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=1575&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：A为一方阵，求(A^k)73得到的矩阵的主对角线的和。&lt;/p&gt;</description></item><item><title>codeforces #341 div 2 E. Wet Shark and Blocks (数位dp+矩阵加速)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-02-08-cf621e/</link><pubDate>Mon, 08 Feb 2016 09:04:41 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-02-08-cf621e/</guid><description>&lt;h3 class="relative group"&gt;&lt;a href="http://codeforces.com/problemset/problem/621/E" target="_blank" rel="noreferrer"&gt;http://codeforces.com/problemset/problem/621/E&lt;/a&gt;
 &lt;div id="" 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="#" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h3&gt;
&lt;p&gt;题意：有b组数，每组数均有n个且相同。你必须在每组选一个数，组成一个新数sum，使得sum % x == k，问方案数 % (1e9+7)。&lt;/p&gt;</description></item></channel></rss>