| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
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 value 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) |
