Hi, I was trying to craft a contest. It is partially reviewed by a coordinator. However I am unable to add more problems to it.
Not sure if it's a bug because I could comfortably add them ~3-4 months ago.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 162 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
Hi, I was trying to craft a contest. It is partially reviewed by a coordinator. However I am unable to add more problems to it.
Not sure if it's a bug because I could comfortably add them ~3-4 months ago.
inline int inv(int a, int m) {
a %= m;
if (a < 0) a += m;
int b = m, u = 0, v = 1;
while (a) {
int t = b / a;
ux++;
b -= t * a; swap(a, b);
u -= t * v; swap(u, v);
}
assert(b == 1);
if (u < 0) u += m;
return u;
}
I bumped into this while reading tourist's code for today's Atcoder's F. It finds the inverse of a modulo m if it exists. All I could understand is that, b has to be 1 in the end for the inverse to exist. Could anyone help me understand this code?
TIA.
Name |
---|