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 | 18963 |
37.03%
|
5270 |
79.91%
|
|
|
|
10518 - How Many Calls? | 5549 |
44.58%
|
1420 |
88.52%
|
|
|
|
10655 - Contemplation! Algebra | 11083 |
20.82%
|
1463 |
58.58%
|
|
|
|
10870 - Recurrences | 5325 |
60.79%
|
1356 |
94.10%
|
|
|
|
11486 - Finding Paths in Grid | 1275 |
51.61%
|
286 |
90.91%
|
|
|
|
12470 - Tribonacci | 2821 |
69.69%
|
809 |
94.81%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |