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 | 19097 |
37.19%
|
5303 |
80.01%
|
|
|
|
10518 - How Many Calls? | 5598 |
44.71%
|
1428 |
88.59%
|
|
|
|
10655 - Contemplation! Algebra | 11283 |
20.82%
|
1470 |
58.64%
|
|
|
|
10870 - Recurrences | 5381 |
60.83%
|
1368 |
94.15%
|
|
|
|
11486 - Finding Paths in Grid | 1286 |
51.71%
|
289 |
91.00%
|
|
|
|
12470 - Tribonacci | 2851 |
69.84%
|
817 |
94.74%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |