Hi there, Is there any page where to practice distributed algorithms?, codejam distributed seems really good however the problem list isn't available ( it says Coming Soon )
Thanks in advance.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
Hi there, Is there any page where to practice distributed algorithms?, codejam distributed seems really good however the problem list isn't available ( it says Coming Soon )
Thanks in advance.
I have been solving Stone Age Problem and something caught my attention, what is the real complexity for map.clear and unordered_map.clear
The same code using map.clear passes but unorder_map.clear however cppreference says both are linear, so what is the real complexity.
UPD1: I have proved that isn't related with collision because I haven tested initiating a new one instead of cleaning and it passes. AC
| Название |
|---|


