Hi everyone! I have finally finished my first problem. You can find it here. Constructive feedback welcome! Comment how long it took you to solve it :)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | Proof_by_QED | 130 |
| 9 | AmShZ | 130 |
| Name |
|---|



Why the downvotes? Is it colour bias -_-
To me, a good problem should hit a few criteria
I feel like this problem hits none of those criteria, which is probably why it got downvoted. That's not to say you should give up; most people's first attempt at a problem isn't very good. (Honestly, it's not that bad for a first try.) Keep trying and hopefully you can come up with something better.
Thank you for taking a look at my problem! My original thought for this problem didn't include the restriction on slot 3, but I wasn't able to find a solution. (maybe its NP-Hard?) I will put those aspects of a good problem into mind when making the other problems in this series.
Few things to note
please never make the samples directly from the solution for a constructive, it makes it way too obvious to guess, especially in this case.
its simply not a good problem since there is basically no nice/(or any imo) observation, the idea of greedily searching in order is very standard, and again your samples make it even more obvious
it took me like 10m ig
take the downvotes as feedback, you posted a problem and got downvoted, this means the problem is probably bad, though I will admit others not explaining why is odd.
Code incase anyone cares enough
Task is good. But i tried to pop_front for 15 minutes, and after that i see that you should get element from back :P. I think better to print that:
Slot starts from end of arrayOr give a hint. Maybe i'm dumb and read the Explanation. But problem good. This is not 100% implementation. I don't know how others do that, but tried to find and x — the intial number when i try to sort:
x = 1: we trying to find the number
1in 1 and 2 slotsx = 2: we trying to find the number
2in 1 and 2 slotsAnd after that get the element from 1 or 2 slot and put in 3 slot.
Keep it up. Your problems good.