| # | User | Rating |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 1 | maomao90 | 161 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 10 | TheScrasse | 142 |
2 step buy-sell processes
In competitive programming one is often faced with the task to simulate what I call a "buy-sell" (or craft-melt) process where in the first step the player spends a certain amount of resources $$$a$$$ from his budget $$$n$$$ and in the second step he acquires $$$b$$$ units of the resource back by selling what he bought or crafted earlier where the relationship
stands.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
TunaMayoSandwich | 2024-07-26 16:31:49 | 643 | Tiny change: 'it doesn't' -> 'it doesn't.\n\nHp: $n, a, b \in \mathbb{N}$, $n \geq a > b$.' (published) | |
| en2 |
|
TunaMayoSandwich | 2024-07-25 20:09:19 | 2020 | Tiny change: '\n\n$n - k*a$' -> '\n\n$n - k \cdot a$' | |
| en1 |
|
TunaMayoSandwich | 2024-07-25 19:39:36 | 402 | Initial revision (saved to drafts) |
