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 | 19026 |
37.09%
|
5287 |
79.97%
|
|
|
|
10518 - How Many Calls? | 5565 |
44.62%
|
1421 |
88.53%
|
|
|
|
10655 - Contemplation! Algebra | 11113 |
20.86%
|
1465 |
58.63%
|
|
|
|
10870 - Recurrences | 5339 |
60.76%
|
1358 |
94.11%
|
|
|
|
11486 - Finding Paths in Grid | 1276 |
51.65%
|
287 |
90.94%
|
|
|
|
12470 - Tribonacci | 2840 |
69.82%
|
811 |
94.82%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |