Could you please tell me some problems which could be solved using matrix exponentiation on codeforces or other judges ?
Thanks.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Could you please tell me some problems which could be solved using matrix exponentiation on codeforces or other judges ?
Thanks.
Name |
---|
easy hard
if you want to solve the easy one you can guess it from first solutions. if you want to solve the hard one just listen to me here: you can represent a+b√k as 2x2 matrix [a b ; kb a] . the ; ends the first row and this way you can also make matrix multiplication faster as you need only O(n*n) good luck
http://codeforces.net/gym/100199, problem E
this problem is really good wow. also D in this gym can be solved if you know matrix multiplication. but in E here is a hint : if you are at row i how do you use row i-1 ? how do you know how many times did a certain pattern exist at the past row? why is m so little m<=5 ?
http://codeforces.net/contest/222/problem/E
There is a category for Matrix Exponentiation problems in lightoj. Here is the link , i hope it will be helpful. http://www.lightoj.com/volume_problemcategory.php?user_id=8956&category=Matrix%20Exponentiation
185A - Plant
https://www.hackerearth.com/problem/algorithm/abcd-strings/description/
http://codeforces.net/problemset/problem/166/E
1117D - Magic Gems
1106F Lunar New Year and a Recursive Sequence
1182E — Product Oriented Recurrence
Apart from the above mentioned problem, the following problems can also be solved by matrix exponentiation.
621E — Wet Shark and Blocks
147B — Smile House
Here you can read how LINK
http://acm.timus.ru/problem.aspx?space=1&num=1462