矩阵快速幂 - Virtual Judge

Begin: 1634720400000

矩阵快速幂

End: 1635238800000

Elapsed:

Remaining:

	Stat	#	Origin	Title
		A	HDU 2793	Sum of Tribonacci Numbers
		B	HDU 5950	Recursive sequence
		C	HDU 6470	Count
		D	HDU 3306	Another kind of Fibonacci
		E	POJ 3070	Fibonacci
		F	POJ 3735	Training little cats
		G	CodeForces 185A	Plant
		H	CodeForces 450B	Jzzhu and Sequences
		I	HDU 5667	Sequence
		J	HDU 5015	233 Matrix
		K	HDU 6030	Happy Necklace
		L	HDU 2256	Problem of Precision
		M	HDU 5451	Best Solver
		N	HDU 4565	So Easy!
		O	HDU 5674	Function
		P	CodeForces 1117D	Magic Gems
		Q	CodeForces 222E	Decoding Genome
		R	CodeForces 1106F	Lunar New Year and a Recursive Sequence
		S	POJ 3233	Matrix Power Series
		T	HDU 2276	Kiki & Little Kiki 2
		U	HDU 2157	How many ways??

Status

My Status

Select a statement for participants:

Run ID	Username	Prob	Result	Time (ms)	Mem (MB)	Length	Lang	Submit Time

{"id":463714,"title":"矩阵快速幂","type":1,"openness":0,"authStatus":1,"begin":1634720400000,"end":1635238800000,"createTime":1634720130000,"started":true,"ended":true,"managerId":347382,"managerName":"kldrgon","groupShortName":"cuit19","groupName":"cuit19","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":41149,"title":"Sum of Tribonacci Numbers","oj":"HDU","probNum":"2793","num":"A","publicDescId":3227584418568933,"publicDescVersion":1714119968000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDOJ+2009+Summer+Exercise%A3%A85%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ 2009 Summer Exercise（5） \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003ehhanger@zju\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,true]},{"pid":542666,"title":"Recursive sequence","oj":"HDU","probNum":"5950","num":"B","publicDescId":3358063568047053,"publicDescVersion":1715856453000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2016ACM%2FICPC%D1%C7%D6%DE%C7%F8%C9%F2%D1%F4%D5%BE-%D6%D8%CF%D6%C8%FC%A3%A8%B8%D0%D0%BB%B6%AB%B1%B1%B4%F3%D1%A7%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2016ACM/ICPC亚洲区沈阳站-重现赛（感谢东北大学） \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":2289897,"title":"Count","oj":"HDU","probNum":"6470","num":"C","publicDescId":2931247866480735,"publicDescVersion":1715279740000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d%A1%B0%D7%D6%BD%DA%CC%F8%B6%AF-%CE%C4%D4%B6%D6%AA%D0%D0%B1%AD%A1%B1%B9%E3%B6%AB%B9%A4%D2%B5%B4%F3%D1%A7%B5%DA%CA%AE%CB%C4%BD%EC%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e “字节跳动-文远知行杯”广东工业大学第十四届程序设计竞赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":18576,"title":"Another kind of Fibonacci","oj":"HDU","probNum":"3306","num":"D","publicDescId":3157749624133266,"publicDescVersion":1715964970000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDOJ+Monthly+Contest+%A8C+2010.02.06+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ Monthly Contest – 2010.02.06  \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003ewyb\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10759,"title":"Fibonacci","oj":"POJ","probNum":"3070","num":"E","publicDescId":3158035523622488,"publicDescVersion":1715498326000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dStanford+Local+2006\"\u003eStanford Local 2006\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":15261,"title":"Training little cats","oj":"POJ","probNum":"3735","num":"F","publicDescId":3164683115465835,"publicDescVersion":1716086442000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dPKU+Campus+2009+%28POJ+Monthly+Contest+%E2%80%93+2009.05.17%29\"\u003ePKU Campus 2009 (POJ Monthly Contest – 2009.05.17)\u003c/a\u003e, Facer\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":29297,"title":"Plant","oj":"CodeForces","probNum":"185A","num":"G","publicDescId":3116131243774709,"publicDescVersion":1715674621000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/185\"\u003eCodeforces Round 118 (Div. 1)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    math\r\n\n\r\n    *1300\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/4488\" title\u003d\"Tutorial\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":51919,"title":"Jzzhu and Sequences","oj":"CodeForces","probNum":"450B","num":"H","publicDescId":3192453772315260,"publicDescVersion":1715976394000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/450\"\u003eCodeforces Round 257 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    implementation\r\n\n\r\n    math\r\n\n\r\n    *1300\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/13112\" title\u003d\"Codeforces Round #257 Editorial\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":364627,"title":"Sequence","oj":"HDU","probNum":"5667","num":"I","publicDescId":3265802201017447,"publicDescVersion":1715027740000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dBestCoder+Round+%2380\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #80 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":53229,"title":"233 Matrix","oj":"HDU","probNum":"5015","num":"J","publicDescId":3281685171645301,"publicDescVersion":1715556776000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2014+ACM%2FICPC+Asia+Regional+Xi%26%23039%3Ban+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2014 ACM/ICPC Asia Regional Xi\u0027an Online \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":797966,"title":"Happy Necklace","oj":"HDU","probNum":"6030","num":"K","publicDescId":3320638772580424,"publicDescVersion":1715642879000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2017%D6%D0%B9%FA%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%BE%BA%C8%FC+-+%C5%AE%C9%FA%D7%A8%B3%A1\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2017中国大学生程序设计竞赛 - 女生专场 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":32559,"title":"Problem of Precision","oj":"HDU","probNum":"2256","num":"L","publicDescId":3215294235660225,"publicDescVersion":1715586204000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDOJ+2008+Summer+Exercise%A3%A84%A3%A9-+Buffet+Dinner\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDOJ 2008 Summer Exercise（4）- Buffet Dinner \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":244754,"title":"Best Solver","oj":"HDU","probNum":"5451","num":"M","publicDescId":3296359377966049,"publicDescVersion":1715592453000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"102400 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2015+ACM%2FICPC+Asia+Regional+Shenyang+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2015 ACM/ICPC Asia Regional Shenyang Online \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":44687,"title":"So Easy!","oj":"HDU","probNum":"4565","num":"N","publicDescId":3168561173648707,"publicDescVersion":1715682439000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2013+ACM-ICPC%B3%A4%C9%B3%C8%FC%C7%F8%C8%AB%B9%FA%D1%FB%C7%EB%C8%FC%A1%AA%A1%AA%CC%E2%C4%BF%D6%D8%CF%D6\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2013 ACM-ICPC长沙赛区全国邀请赛——题目重现 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":368987,"title":"Function","oj":"HDU","probNum":"5674","num":"O","publicDescId":3269175021054851,"publicDescVersion":1715988609000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dBestCoder+Round+%2381+%28div.1%29\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #81 (div.1) \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":2225711,"title":"Magic Gems","oj":"CodeForces","probNum":"1117D","num":"P","publicDescId":2837550439805010,"publicDescVersion":1715529262000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/1117\"\u003eEducational Codeforces Round 60 (Rated for Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dp\r\n\n\r\n    math\r\n\n\r\n    matrices\r\n\n\r\n    *2100\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/65308\" title\u003d\"65308\" target\u003d\"_blank\"\u003eAnnouncement\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/65365\" title\u003d\"65365\" target\u003d\"_blank\"\u003eTutorial\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":31922,"title":"Decoding Genome","oj":"CodeForces","probNum":"222E","num":"Q","publicDescId":3213202140304303,"publicDescVersion":1716079457000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/222\"\u003eCodeforces Round 137 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    dp\r\n\n\r\n    matrices\r\n\n\r\n    *1900\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/5248\" title\u003d\"Codeforces Round #137 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement #2\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/5251\" title\u003d\"Разбор задач Codeforces Round #137 (Div. 2)\" target\u003d\"_blank\"\u003eTutorial #1\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":2192794,"title":"Lunar New Year and a Recursive Sequence","oj":"CodeForces","probNum":"1106F","num":"R","publicDescId":2838753554639958,"publicDescVersion":1715794263000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Source","content":"\u003ca style\u003d\"color: black\" href\u003d\"https://codeforces.com/contest/1106\"\u003eCodeforces Round 536 (Div. 2)\u003c/a\u003e","spoiler":true},{"title":"Tags","content":"\r\n    math\r\n\n\r\n    matrices\r\n\n\r\n    number theory\r\n\n\r\n    *2400\r\n","spoiler":true},{"title":"Editorial","content":"\u003ca href\u003d\"https://codeforces.com/blog/entry/64884\" title\u003d\"Codeforces Round #536 (Div. 2)\" target\u003d\"_blank\"\u003eAnnouncement \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e\n\u003ca href\u003d\"https://codeforces.com/blog/entry/64928\" title\u003d\"Tutorial\" target\u003d\"_blank\"\u003eTutorial \u003cspan class\u003d\"resource-locale\"\u003e(en)\u003c/span\u003e\u003c/a\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","languages":{"88":"Kotlin 1.9.21","89":"GNU G++20 13.2 (64 bit, winlibs)","67":"Ruby 3.2.2","28":"D DMD32 v2.105.0","70":"PyPy 3.10 (7.3.15, 64bit)","50":"GNU G++14 6.4.0","51":"PascalABC.NET 3.8.3","31":"Python 3.8.10","75":"Rust 1.75.0 (2021)","54":"GNU G++17 7.3.0","32":"Go 1.22.2","55":"Node.js 15.8.0 (64bit)","12":"Haskell GHC 8.10.1","34":"JavaScript V8 4.8.0","79":"C# 10, .NET SDK 6.0","13":"Perl 5.20.1","36":"Java 8 32bit","19":"OCaml 4.02.1","3":"Delphi 7","4":"Free Pascal 3.2.2","6":"PHP 8.1.7","7":"Python 2.7.18","9":"C# Mono 6.8","83":"Kotlin 1.7.20","40":"PyPy 2.7.13 (7.3.0)","41":"PyPy 3.6.9 (7.3.0)","20":"Scala 2.12.8","43":"GNU GCC C11 5.1.0","65":"C# 8, .NET Core 3.1","87":"Java 21 64bit"},"submitMethods":[true,true,true]},{"pid":10959,"title":"Matrix Power Series","oj":"POJ","probNum":"3233","num":"S","publicDescId":3158370273529864,"publicDescVersion":1715818241000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"131072 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dPOJ+Monthly--2007.06.03\"\u003ePOJ Monthly--2007.06.03\u003c/a\u003e, Huang, Jinsong\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10966,"title":"Kiki \u0026amp; Little Kiki 2","oj":"HDU","probNum":"2276","num":"T","publicDescId":3158391694654332,"publicDescVersion":1715416056000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDU+8th+Programming+Contest+Site%A3%A81%A3%A9\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 8th Programming Contest Site（1） \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":40915,"title":"How many ways??","oj":"HDU","probNum":"2157","num":"U","publicDescId":3224675701741635,"publicDescVersion":1716032415000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2008%D0%C5%CF%A2%B9%A4%B3%CC%D1%A7%D4%BA%BC%AF%D1%B5%B6%D3%A1%AA%A1%AA%D1%A1%B0%CE%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008信息工程学院集训队——选拔赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003e小黑\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]}],"problemsHash":"0392eac3f1da53c7979d9802438f7db0","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}