Plss tell me how to determine the time complexity of a solution which can get accepted by looking at the constraints of the problem. Plss help!!!
Plss tell me how to determine the time complexity of a solution which can get accepted by looking at the constraints of the problem. Plss help!!!
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
here:
laughs in Ashishgup
Lol. I've gotten quite a few comments/messages regarding the low constraints — and this is the exact reason I choose to keep them that way.
Constraints shouldn't be a hint towards the solution, and unless there is some obvious brute solution that passes with lower constraints — I choose to keep them that way.
Also allows different (non-brute) approaches.