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 | 18747 |
36.89%
|
5249 |
79.90%
|
|
|
|
10518 - How Many Calls? | 5475 |
44.60%
|
1410 |
88.51%
|
|
|
|
10655 - Contemplation! Algebra | 10846 |
20.99%
|
1453 |
58.77%
|
|
|
|
10870 - Recurrences | 5272 |
60.70%
|
1342 |
94.19%
|
|
|
|
11486 - Finding Paths in Grid | 1267 |
51.85%
|
283 |
91.52%
|
|
|
|
12470 - Tribonacci | 2783 |
69.64%
|
801 |
95.01%
|
|
| << Start < Prev 1 Next > End >> | ||
| Display # | Results 1 - 6 of 6 | |