Hi Everyone, I came across a problem on HackerEarth, I tried on it for sometime but am not able to solve it yet ! Also, there is no editorial of the problem, so need a little help on how to approach the problem ! Thanks in Advance !
Hi Everyone, I came across a problem on HackerEarth, I tried on it for sometime but am not able to solve it yet ! Also, there is no editorial of the problem, so need a little help on how to approach the problem ! Thanks in Advance !
Motivation problem: We have a tree consisting of n(<=10^5) nodes. We will consider the tree nodes indexed from 1 to n. We will also consider the first node to be initially painted red, and...
Need help in this problem!! Somebody please tell me how to approach the problem?
You are to write a program that will find the number of different red-green towers of height h modulo 10^9 + 7. The task is to determine how many different red-green towers having h levels can be built out of the available blocks.
Need help in this problem!! Somebody please tell me how to approach the problem?
You are to write a program that will find the number of different red-green towers of height h modulo 10^9 + 7. The task is to determine how many different red-green towers having h levels can be built out of the available blocks.