Error Man 的博客

//组合数打表模板,适用于N<=3000//c[i][j]表示从i个中选j个的选法。long long C[N][N];void table_C(int maxn) { C[0][0] = 1; for(int i = 1; i <= maxn; i++) { C[i][0] = 1; for(int j = 1; j <...

E - Diverse GroupIt’s the year 3018 and you are the head of the Bioinformation Articulation in Cosmic Space (BACS) program at NASA. Under this program, NASA has decided to send K humans to planet Na...

K - WandN wizards are attending a meeting. Everyone has his own magic wand. N magic wands was put in a line, numbered from 1 to n(Wand_i owned by wizard_i). After the meeting, n wizards will take a ...

为什么求组合数取模，可以用 乘法逆元来做。所以求 组合数取模 就是求 % mod.对于正整数和 p，如果有 ，那么把这个同余方程中的最小正整数解叫做 a 模 p 的逆元。即如果% p = 1， 那么x的最小正整数解就是 a 的逆元。可以得到 % M () % M; //费马小定理所以% M =(% M )% M.ty...

E.Partial SumsYou've got an arraya, consisting ofnintegers. The array elements are indexed from 1 ton. Let's determine a two step operation like that:First we build by the arrayaan arrayso...