| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
|
0
"You are not allowed to view the requested page" when I click the link :( |
|
0
My first 2 submissions were ME and I :) Also "r" or "are" would be a cool one |
|
0
But they're truncated! I really want to know more about Japan's tiling and what kind of segfault in the human language compiler I am!!! |
|
0
Where can I download the system tests' jury answers for problem J? I want to read them fully. |
|
0
As a former expert and current specialist, I was cooked |
|
0
I'm a bit late, but you just say that since $$$a \lt x \leq c$$$ and $$$g$$$ divides $$$x$$$, we just check if there's a multiple of $$$g$$$ that is between $$$a$$$ and $$$c$$$. This can be done similarly to the $$$y$$$ check: the largest $$$x$$$ possible is $$$\lfloor\frac{c}{g}\rfloor \cdot g = x_{max}$$$, so check if $$$a \lt x_{max}$$$. You might think that by choosing $$$x_{max}$$$ this way the gcd could change: $$$gcd(ab, x_{max}) \gt g$$$ and that's true, but it doesn't actually matter: we assume that $$$g$$$ is the gcd, then we find some $$$y = \frac{ab}{g} \cdot k$$$, where $$$k$$$ is some constant, but since the real $$$gcd(ab, x_{max})$$$ is greater than $$$g$$$, that means that our $$$y$$$ is greater than it needed to be, which certainly doesn't hurt us (because we will check the bigger gcd at some point later on). |
| Name |
|---|


