发个可以O(n)时间求逆的代码

张文泰 posted @ 2011年4月17日 18:55 in Code and Develop with tags acm c++ , 7489 阅读 
int[] inv = new int[MAXN];
inv[1] = 1;
for (int i = 2; i<MAXN; i++)
    inv[i] = inv[MOD%i]*(MOD-MOD/i)%MOD;

注意这里的MOD必须是素数。

摘自TopCoder上某人的代码。

本作品遵循“署名-非商业性使用-相同方式共享 3.0 Unported”协议，转载请注明来自richard-desktop。
Creative Commons License
Small_feed 评论 (2)
1
[回复]
CBSE 2nd Class Model 说:
2022年9月14日 13:57

Every year, the Central Board of Secondary Education (CBSE) releases exam materials with sample questions for students studying in Hindi and English at all regional schools. CBSE 2nd Class Model Paper This year, the CBSE also released sample papers for the second grade that are organised by subject for the term 1, term 2, term 3, and term 4 exams that are held at the board and school levels.

2
[回复]
seo service london 说:
2024年1月14日 20:51

There are several dissertation web sites on the net once you locate unsurprisingly explained in the website


登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter