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 | 4009 |
2 | jiangly | 3904 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3494 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | maroonrk | 3350 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
1 | cry | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 159 |
5 | awoo | 158 |
6 | adamant | 157 |
7 | -is-this-fft- | 156 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
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 |
---|