Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

How to AC an n=1000 problem with O(n^3log n) algo
Difference between en1 and en2, changed 12 character(s)
In hindsight, I probably should not have spent this much time on a wrong algorithm.↵
↵
Allow me to present [_Constant Optimization on Binary Exponentiation and Matrix Multiplication_:↵
↵
[Link](https://zhtluo.com/cp/constant-optimization.html).

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Zhtluo 2023-12-02 06:15:11 12
en1 English Zhtluo 2023-12-02 06:14:25 291 Initial revision (published)