| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hello Codeforces Community!
I invite you all to join HackerRank's HourRank 28 on June 3, 2018, at 20:30 IST.
You will be given one hour to solve three tasks. The contest will be rated and the top ten contestants will receive HackerRank T-shirts!
The problems are created by mr.logix, abx_2109, and coderdecode1 and tested by me.
Good luck and happy coding!
The link is showing University Codesprint starting 17 feb and ending 19 feb. Please fix it.
How long until the ratings are updated?
In the second question, the time complexity is of the order 108. Does this always run in the time limit on those platforms (Hackerrank & Hackerearth)?
Can someone please help me understand Tourist's solution to the second problem? Link : https://www.hackerrank.com/rest/contests/hourrank-28/challenges/the-most-elegant-sequence/hackers/Gennady/download_solution
I am unable to understand from line 49 onwards, where the actual DP begins. It would be helpful if someone could clarify the logic.