Browse Problems 
Our Patreons
Diamond Sponsors
Steven & Felix Halim
Reinardus Pradhitya
Gold Sponsors
--- YOUR NAME HERE ----
Silver Sponsors
--- YOUR NAME HERE ----
Bronze Sponsors
Christianto Handojo
Krzysztof Adamek
Fatima Broom
Contribute
Bitcoin:
1ojudgeapLUjJcnUm
ze67a4w3TJ6WnPxo
Browse Problems
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Rare Topics :: Rare Algorithms :: Matrix Power
| Title | Total Submissions / Solving % | Total Users / Solving % | ||||
|
10229 - Modular Fibonacci | 18755 |
36.90%
|
5250 |
79.90%
|
|
|
|
10518 - How Many Calls? | 5476 |
44.61%
|
1411 |
88.52%
|
|
|
|
10655 - Contemplation! Algebra | 10850 |
21.00%
|
1454 |
58.73%
|
|
|
|
10870 - Recurrences | 5272 |
60.70%
|
1342 |
94.19%
|
|
|
|
11486 - Finding Paths in Grid | 1269 |
51.85%
|
284 |
91.55%
|
|
|
|
12470 - Tribonacci | 2789 |
69.59%
|
803 |
94.89%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |