Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems. ×

A Challenge of

Revision en1, by alwcod_nn, 2019-08-21 11:06:00

I found a challenge in the editorial ( :


For which pairs of (n,k) (n>k≥1) is there an arrangement of numbers from 1 to n on a circle such that the sums of each k consecutive numbers differ by not more than 1 ? ( The problem above is a specify case where n=2*k)

My solution is: - if k is even, there are no n satisfied the condition. - if k is odd, only n=2*k satisfied the condition.

Can someone verify this for me?

Thank you very much.


  Rev. Lang. By When Δ Comment
en2 English alwcod_nn 2019-08-23 15:42:56 3 Tiny change: 'very much.\n\n' -> 'very much....\n\n'
en1 English alwcod_nn 2019-08-21 11:06:00 608 Initial revision (published)