| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Help needed for UVA 11312 — Flipping Frustration
Problem Link: https://uva.onlinejudge.org/external/113/11312.pdf
My partial solution:
1) If the given values do not satisfy this equation -> rx + ly = t then there is no solution.
2) Now, in order to find the minimum values I can do a BFS but this will result me a TLE in certain cases. How should I implement this part cleverly?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Tobby_And_Friends | 2017-09-24 14:38:15 | 1 | Tiny change: 'imum values I can do ' -> 'imum value I can do ' | |
| en1 |
|
Tobby_And_Friends | 2017-09-24 14:37:37 | 392 | Initial revision (published) |
