Half of the handles got their solution skipped Not enough..

you need to memoize for the variables which changing in the recursive calls.

is there only 1 machine that runs whole cf?

This sometimes give tle.

.

yes

Go the end of the page to find practice ques

Coool

See this — https://www.youtube.com/watch?v=nJbNe0Yzjhw

kshitijanand36 ..

death note

knife!!

This is Matrix Chain Multiplication variation of DP Video Link (Hindi)

Epic !! Next courses suggestion — Tries

rarely I see someone stuck at Pupil level for so long

See my graph I was stuck at Newbie for 7 8 months

Video

semester

True

They simply don't care!

I think humans overthink about meaning of life tbh..

.

if (lvl % 2 == n % 2)
		seg[x] = seg[2 * x] | seg[2 * x + 1];
	else seg[x] = seg[2 * x] ^ seg[2 * x + 1];

real title : tricks that will increase your rating from lgm to LGM.

keep us updated !! I will also start doing more VCs now..

So this has occured earlier also..

ok got it . Thanks

In F , why the answer is stored at dp(n,0,0,0)?? Thank U

.

.

For B , change each 0 with -1 and then answer becomes the max length subarray having sum as 0.

Just show them some videos how coding is the future and that cp is a very good way of getting good at coding . Also,tell me them cp takes alot more brain than school subjects combined,then maybe they will allow you.

Do waste your time trying to find the “ultimate” method

bcoz there is none..

cool explaination!!

basically number of bitonic permutations ,right!!

For C ,i came up with the logic that bitonic sequences will not result in any cycles. So we just have to subtract them from n! . Is this logic correct??

for C i tried it this way

ll n; cin >> n;
	ll ans  = 1;
	for (ll i = 1 ; i <= n; i++) ans = (ans * i) % mod;
	
	cout << (ans - (1ll << (n - 1)) + mod ) % mod << endl;

this code prints negative number can anyone tell why??

maybe tthey are same person

In C, we can make k-1 subarrays of length 1 .So,these subarrays donot contribute to the answer bcoz max(i) == min(i).And for the array which is left,we can check every subarray from the start of length n -(k-1) and choose that one which give the minimum cost of division and that will be our answer. But ,this approach is not accepted . Can u tell why?? Code 88066269

Plz,tell my mistake for A Code: 87298100

Listen You ASS****!,grey people like me perform bad in every round but dont rant afterwards .This round was genuinely bad.

MAKE THIS ROUND UNRATED!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

Yes the jury was badd

Great round????

No the problem statement was very badly written and the question so very easy

Yes u noticed tooo

yes bcoz of this I wasted more than 1 hour on 2nd question and this made this round very bad for me

Question B was not clear. In the first sample test case,they should have clarified that the 4th and 5th picture are also same (they have different r thats why they should be different). Wasted more than 1 hour on it (I figured the formula in 2minutes) and could not touch C and D properly. Plz,clarify these things.Even on asking the jury ,it said only the last picture(for 1st sample test case) is not considered but actually the last 3 pictures were not considered in the answer.

Thank You!!!

Nice,Thank You!

Thank U !!

I only had 1 downvote.

Yes.I thought that too

I was doing this way only dont know why wrong answer

ok will do.Thank u !

thank u!!

Thank u!!!

me too

thank u buddy

83942386 why is it giving MLE for the first question ????

In problem C for block that is neither first nor last,why cant we do (number of zeros in block)/ (2*k+1)