| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Flipping Frustration [HELP]
Th problem goes like this: You have a book with n ( n<=10^7 ) pages. You can flip exactly X pages to the right and exactly Y pages to the left. If you're initially on page 1, what is the minimum number of moves to go from page 1 to page A?
You can find the problem Here( UVA 11312- Flipping Frustration ).
I will be very thankful if you provide me with a solution.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
Aritra741 | 2019-08-15 07:37:01 | 0 | Tiny change: 'st cases**)\n\nYou ca' -> 'st cases**\n\nYou ca' | |
| en4 |
|
Aritra741 | 2019-08-14 06:46:44 | 0 | Tiny change: '0 test cases**)\n\nYo' -> '0 test cas**)\n\nYo' | |
| en3 |
|
Aritra741 | 2019-08-14 06:45:56 | 21 | Tiny change: 'to page A?\n\nYou ca' -> 'to page A? (**100 test cases**)\n\nYou ca' | |
| en2 |
|
Aritra741 | 2019-08-14 05:42:40 | 1 | Tiny change: 'Th problem g' -> 'The problem g' | |
| en1 |
|
Aritra741 | 2019-08-14 05:39:59 | 505 | Initial revision (published) |
