| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 163 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | awoo | 158 |
| 6 | atcoder_official | 157 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 148 |
Why does it happen? (Post — 1)
LuckyLand Lottery is a problem directly related to Josephus problem!!!
In short:
There are N peoples (N > 0) arranged in a loop (_peoples are numbered from 1 to N_) so that after Nth person 1st person comes. In each lottery round the 2nd person wins starting from random number P (0 < P <= N), then next round starts from that position where it was ended before. Given the value of N and P. You need to find the person who wins at last.
AC soln:
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en8 |
|
slow.coder | 2015-09-28 09:36:07 | 39 | ||
| en7 |
|
slow.coder | 2015-09-28 09:34:12 | 1 | Tiny change: 'e _(winner will not ' -> 'e _(winners will not ' | |
| en6 |
|
slow.coder | 2015-09-28 09:33:44 | 52 | (published) | |
| en5 |
|
slow.coder | 2015-09-28 09:31:03 | 8 | ||
| en4 |
|
slow.coder | 2015-09-28 09:29:53 | 137 | ||
| en3 |
|
slow.coder | 2015-09-28 09:24:48 | 32 | ||
| en2 |
|
slow.coder | 2015-09-28 09:24:02 | 6 | ||
| en1 |
|
slow.coder | 2015-09-28 09:23:03 | 627 | Initial revision (saved to drafts) |
