-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathcombinations.sublime-snippet
81 lines (71 loc) · 1.5 KB
/
combinations.sublime-snippet
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
<snippet>
<content><![CDATA[
const long long MOD = 998244353;
inline long long add(long long a, long long b) {
a += b;
if (a >= MOD) a -= MOD;
return a;
}
inline long long sub(long long a, long long b) {
a -= b;
if (a < 0) a += MOD;
return a;
}
inline long long mul(long long a) {
return a;
}
template<typename... T>
inline long long mul(long long a, T... b) {
return (long long) ((long long) a * mul(b...) % MOD);
}
inline long long power(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) {
res = mul(res, a);
}
a = mul(a, a);
b >>= 1;
}
return res;
}
inline long long inv(long long a) {
a %= MOD;
if (a < 0) a += MOD;
long long b = MOD, u = 0, v = 1;
while (a) {
long long t = b / a;
b -= t * a; swap(a, b);
u -= t * v; swap(u, v);
}
assert(b == 1);
if (u < 0) u += MOD;
return u;
}
const int MAXN = 1e6 + 10;
vector<long long> fact(MAXN) , ifact(MAXN);
void pre() {
fact[0] = ifact[0] = 1LL;
fact[1] = ifact[1] = 1LL;
for(int i = 2 ; i < MAXN ; ++i) {
fact[i] = mul(fact[i - 1] , 1LL * i);
ifact[i] = inv(fact[i]);
}
}
long long P(int N , int K) {
if(K > N) {
return 0LL;
}
return mul(fact[N] , ifact[N - K]);
}
long long C(int N , int K) {
if(K > N) {
return 0LL;
}
return mul(fact[N] , ifact[N - K] , ifact[K]);
}
]]></content>
<tabTrigger>combinations</tabTrigger>
<!-- Optional: Set a scope to limit where the snippet will trigger -->
<!-- <scope>source.python</scope> -->
</snippet>