hard problem

Правка en1, от tynker, 2023-08-27 04:24:35

you have $$$n$$$ $$$(1 \leq n \leq 7000)$$$ days and $$$m$$$ $$$(1 \leq m \leq 10^{18})$$$ songs.

you're given two parameters $$$k$$$ and $$$p$$$. $$$0 \le k \le m$$$ and $$$1 \leq p \leq 4$$$.

on each day $$$i$$$ you're given 3 parameters $$$x_i$$$ $$$a_i$$$ and $$$b_i$$$. meaning $$$x_i$$$ songs will be played starting from $$$b_i$$$-th song, and stepping by $$$k$$$. So songs with indexes $$$b_i, b_i + k (mod \; m), ..., b_i + (x_i - 1) * k (mod \; m)$$$ will be played. Each one of them will be played $$$a_i$$$ times.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский tynker 2023-08-27 05:33:26 4 Tiny change: '. $(0 < k \le m)$ and $' -> '. $(0 < k < m)$ and $'
en4 Английский tynker 2023-08-27 05:32:54 4 Tiny change: ' $p$. $(0 \le k \le m)$' -> ' $p$. $(0 < k \le m)$'
en3 Английский tynker 2023-08-27 04:35:56 6 Tiny change: 'different **with no' -> 'different songs **with no'
en2 Английский tynker 2023-08-27 04:31:11 311 Tiny change: 'fferent \textbf{with ' -> 'fferent \txtbf{with ' (published)
en1 Английский tynker 2023-08-27 04:24:35 476 Initial revision (saved to drafts)