Hint
Hint
Solution
Hint
Solution
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Codeforces Round #876 (Div. 2) Editorial
The first and last elements are always equal to $$$1$$$.
There are at least $$$\lceil \frac{n - 1}{k} \rceil$$$ ones among the first $$$n - 1$$$ elements.
Try to solve the problem if all $$$a_i$$$ are equal.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| ru3 |
|
valerikk | 2023-06-03 20:11:15 | 0 | (опубликовано) | |
| ru2 |
|
valerikk | 2023-06-03 20:10:56 | 1 | Мелкая правка: 'и первых $$n - 1$ эл' -> 'и первых $n - 1$ эл' | |
| ru1 |
|
valerikk | 2023-06-03 20:10:05 | 2044 | Первая редакция перевода на Русский (сохранено в черновиках) | |
| en11 |
|
valerikk | 2023-06-03 20:01:08 | 0 | (published) | |
| en10 |
|
valerikk | 2023-06-03 19:56:50 | 2 | Tiny change: 'oiler>\n\n[probl' -> 'oiler>\n\n\n[probl' | |
| en9 |
|
valerikk | 2023-06-03 19:54:30 | 17 | Tiny change: 'each round, connect ' -> 'each round of the game, connect ' | |
| en8 |
|
valerikk | 2023-06-03 19:53:26 | 615 | ||
| en7 |
|
valerikk | 2023-06-03 19:47:24 | 45 | ||
| en6 |
|
valerikk | 2023-06-03 19:46:39 | 298 | ||
| en5 |
|
valerikk | 2023-06-03 19:43:25 | 46 | ||
| en4 |
|
valerikk | 2023-06-03 19:42:14 | 415 | ||
| en3 |
|
valerikk | 2023-06-03 19:39:38 | 172 | ||
| en2 |
|
valerikk | 2023-06-03 19:37:02 | 18 | ||
| en1 |
|
valerikk | 2023-06-03 19:36:22 | 371 | Initial revision (saved to drafts) |
| Name |
|---|


