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 | 19055 |
37.16%
|
5296 |
80.00%
|
|
|
|
10518 - How Many Calls? | 5590 |
44.69%
|
1424 |
88.55%
|
|
|
|
10655 - Contemplation! Algebra | 11139 |
20.85%
|
1467 |
58.62%
|
|
|
|
10870 - Recurrences | 5347 |
60.80%
|
1361 |
94.12%
|
|
|
|
11486 - Finding Paths in Grid | 1277 |
51.68%
|
288 |
90.97%
|
|
|
|
12470 - Tribonacci | 2845 |
69.84%
|
814 |
94.84%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |