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 | 18710 |
36.83%
|
5242 |
79.87%
|
|
|
|
10518 - How Many Calls? | 5396 |
44.64%
|
1409 |
88.50%
|
|
|
|
10655 - Contemplation! Algebra | 10817 |
20.98%
|
1449 |
58.87%
|
|
|
|
10870 - Recurrences | 5255 |
60.61%
|
1337 |
94.17%
|
|
|
|
11486 - Finding Paths in Grid | 1261 |
51.94%
|
282 |
91.49%
|
|
|
|
12470 - Tribonacci | 2662 |
70.62%
|
797 |
94.98%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |