Блог пользователя Apricus

Автор Apricus, история, 3 года назад, По-английски

Hi Codeforces Friends, I was recently doing an array shift left problem and I was trying to use modulo to achieve that. However, I wasn't able to derive a general formula for it, and I try this in both the 0-index way and the 1-index way. Do you guys have any idea?

ex:

k — the number of times to shift left

A — the array

output the final array after k times shifting left

Полный текст и комментарии »

  • Проголосовать: нравится
  • -23
  • Проголосовать: не нравится