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 | 17914 |
36.69%
|
5175 |
79.85%
|
|
|
|
10518 - How Many Calls? | 5315 |
44.44%
|
1396 |
88.47%
|
|
|
|
10655 - Contemplation! Algebra | 10027 |
21.08%
|
1426 |
58.84%
|
|
|
|
10870 - Recurrences | 5094 |
60.66%
|
1312 |
94.21%
|
|
|
|
11486 - Finding Paths in Grid | 1244 |
52.09%
|
279 |
91.40%
|
|
|
|
12470 - Tribonacci | 2617 |
70.69%
|
786 |
94.91%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |