Hint
Hint
Solution
Hint
Solution
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 162 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
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 |
---|