Well, what could u expect from hackerearth

When will the prizes be processed?

I wrote dp[0][m + 1][m + 1][m + 1] = 1 as my base case because initially there will be no elements in lis array and i took m+1 so that all subsequent elements will be less than it so can be instantly inserted in lis array.

we will assume fir, sec, and third are three elements in lis array and fir<=sec<=third. now we'll assume x be the next element, then we'll check which element it replace fir, sec, third or none. you can look at this for reference. Link

2nd problem is harder version of this cses problem

.

it also worked when i shifted from GNU C++17 to GNU C++20. and thank u very much for taking the time to analyze my code.

somebody please help. why this is giving RTE?.link

Yeah. For me the choice is clear but it'll surely lower the participation.

It is clashing with december Cook off.

how many problems would be there?

but in my code that doesn't affect the answer. Code

what was the pretest 9 in problem D about?

respect++

Man i hate codechef!

i also did the same thing but was confused how it fit in time limit. thanks anyways.

wont gcd take logn time?

what is the time complexity of ur solution?

ok. thanks for making it clear.

can u tell me why for n = 3 {1,2,3} is not valid in Planning Trips?

you are a toxic person.

.

thanks ur comment saved me a headache.

No,it proves there were more people like you who didn't read the statement properly and were bugging authors with queries.

.

what is the time complexity?

When will the editorial be out?

Supermagzzz why are taking only a<b in 1538G - Подарочный набор ?

Supermagzzz why are we taking only a<b in 1538G - Подарочный набор?

That is bullshit!

Same happened with me. MLE

AC

cost me atleat 400 rank.

You say this in every contest.

.

Can u give an intuition why answer for max of the range is the final answer for the range.

Not Again!!!

thanks

why did u do *2 in the ans?

thank u so much bro! u saved me so much effort