Help with DCP-141: Motku.

Правка en1, от 2ndSequence, 2020-08-22 06:17:33

I was trying to solve this problem but i am totally stuck.

I can use binary lifting to know the sum from node a to b i believe or walk specific number of moves but i can't just figure out how i will maintain that multiplication process.

I also faced other problems like this before but i couldn't solve any sadly so hope if someone can give me a hint, or explain any valid solution.

Similar problems like adding arithmetic progression to a specific range.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский 2ndSequence 2020-08-22 06:17:33 544 Initial revision (published)