Menu Sidebar
Menu

Leetcode

线性求逆元

https://leetcode.com/problems/count-the-number-of-good-subsequences/description/ 求[1,n]的所有数逆元在模p下的逆元, 用pow(n,p – 2,p)太慢了。所有用下面代码

Older Posts

书脊

这青苔碧瓦堆, 俺曾睡风流觉, 将五十年兴亡看饱.

July 2024
M T W T F S S
1234567
891011121314
15161718192021
22232425262728
293031