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 | 18668 |
36.77%
|
5238 |
79.86%
|
|
|
|
10518 - How Many Calls? | 5379 |
44.60%
|
1407 |
88.49%
|
|
|
|
10655 - Contemplation! Algebra | 10734 |
20.78%
|
1445 |
58.82%
|
|
|
|
10870 - Recurrences | 5242 |
60.55%
|
1336 |
94.16%
|
|
|
|
11486 - Finding Paths in Grid | 1261 |
51.94%
|
282 |
91.49%
|
|
|
|
12470 - Tribonacci | 2660 |
70.60%
|
795 |
94.97%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |