Solving D.TediousLee Using Recurrence in O(log n)

Правка en1, от grapo_Oranges, 2020-06-24 21:13:57

This Problem was given by DeadlyCritic as challenge

Statement:

Given 1369D - TediousLee solve it for $$$10^{18}$$$ without using Matrix Exponentiation.

Solution:

In order to maximize the number of Claws, the basic idea is to keep track of no. of nodes with no child at any $$$k^{th}$$$

Теги math, sequences and series

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en6 Английский grapo_Oranges 2020-06-24 22:56:55 4
en5 Английский grapo_Oranges 2020-06-24 22:48:03 2
en4 Английский grapo_Oranges 2020-06-24 22:43:40 10
en3 Английский grapo_Oranges 2020-06-24 22:37:40 41 (published)
en2 Английский grapo_Oranges 2020-06-24 22:33:33 1829 Tiny change: ' track of _no. of nodes_ with no c' -> ' track of $no. of nodes$ with no c'
en1 Английский grapo_Oranges 2020-06-24 21:13:57 373 Initial revision (saved to drafts)