Hello everyone!

I would like to invite you to participate in HackerEarth November Circuits '18. It's a long contest that will start on November 23, 21:00 IST (check your timezone). The contest will run for 9 days.

The participants will be challenged with 7 traditional algorithmic tasks and 1 approximate problem of varying difficulty levels in a duration of 9 days. For traditional algorithmic tasks, you will receive points for every test case your solution passes — so you can get some points with partial solutions as well. For the approximation task, your score depends on the best solution in the contest so far. Here is the detailed timeline of the challenge,

• Day — 0 Problem 1, Problem 2, Problem 3 (Approximate)
• Day — 1 Problem 4, Problem 5
• Day — 4 Problem 6, Problem 7
• Day — 6 Problem 8
• Day — 9 Challenge ends

As usual, there will be some nice prizes for the top five competitors:

1. $100 Amazon gift card + HE t-shirt.
2. $75 Amazon gift card + HE t-shirt.
3. $50 Amazon gift card + HE t-shirt.
4. HE t-shirt.
5. HE t-shirt.

I am one of the problem setter. I'd like to thank the problem setters Mayank (mak_0111), Aashray (aashrayagarwal) and Gabriel Cojocaru (I_Love_Tina) and the tester Niyaz Nigmatullin (niyaznigmatul).

The contest will be RATED.

Happy Coding :)

hello guys , so i was trying to solve a question and came up with this one.

Given a tree with N nodes , you need to find the number of Pth cousins . where a Pth cousin is defined as a pair of nodes x,y and there exists a node z which is Pth ancestor of both x and y . you need to print an array of n integers each denoting the count of ith cousins , where 1<=i<=n .

1<n<=100000

A tree rooted at 1 is given , we have to perform two type of queries . - type 1 (u,x): update value of node node u to x. - type 2 (u,x): count the number of node having value less than x in path from u to 1. n<=100000 q<=100000

hello everyone! i am a newbie and trying to learn dynamic programming , i find it easy to write a recursive solution but it i find it difficult to memoize it. or you can say , that i am unable to judge on what factors dp state depends . any help would be appreciated . :)