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
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 | 18919 |
37.01%
|
5265 |
79.91%
|
|
|
|
10518 - How Many Calls? | 5543 |
44.54%
|
1418 |
88.50%
|
|
|
|
10655 - Contemplation! Algebra | 11073 |
20.84%
|
1462 |
58.62%
|
|
|
|
10870 - Recurrences | 5301 |
60.74%
|
1350 |
94.07%
|
|
|
|
11486 - Finding Paths in Grid | 1275 |
51.61%
|
286 |
90.91%
|
|
|
|
12470 - Tribonacci | 2819 |
69.67%
|
809 |
94.81%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |


