We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0a9f356 commit e8b6c2cCopy full SHA for e8b6c2c
Math/1916.Count-Ways-to-Build-Rooms-in-an-Ant-Colony/Readme.md
@@ -25,7 +25,8 @@ YXXY
25
```cpp
26
dp[node] = num[node] ! / (num[child1]! * num[child2]! * ... * num[childk]!) * dp[child1] * dp[child2] * ... * dp[childk]
27
```
28
-注意到上述的式子中含有出发,对大数取模的过程遇到除法需要用到逆元运算,即
+注意到上述的式子中含有除法,对大数取模的过程遇到除法需要用到逆元运算,即
29
30
-dp[node] % M = num[node] ! * inv(num[child1]! * num[child2]! * ... * num[childk]!) * dp[child1] * dp[child2] * ... * dp[childk] % M
+(a / b) % M = a * inv(b, M)
31
32
+关于逆元计算的模板见[这里](https://github.com/wisdompeak/LeetCode/tree/master/Template/Inverse_Element)
0 commit comments