Please add such a feature in magic so that we can also change our rating to whatever we want upto 10th January
Isn't it great?? comment down your thoughts below
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
Please add such a feature in magic so that we can also change our rating to whatever we want upto 10th January
Isn't it great?? comment down your thoughts below
I stucked in this question for long now I tried in almost all possible cases but still it kept showing wrong answer on test#2 please help, whats wrong in my code or you can give some strong test cases.
Hey everyone I am stuck in this problem Find a non empty subset in an array of N integers such that sum of elements of subset is divisible by N It's also available on gfg link... but explanation is not quiet clear !! it will be really helpful if some-one explains approach to me.
| Название |
|---|


