Codeforces Round 996 (Div 2) | Video Solutions - A to D | by Soumojit Chatterjee | TLE Eliminators

[@venkatmalviya2421]

1st: abs(a-b)%2==0: Yes else: no

[@soumojitchatterjee6943]

In the problem C (The Trail), I was asked why I kept the Target sum x value to 0. We saw that a non-zero value of x doesn't work for test cases where n != m.
I apologise that I couldn't formally show a proof in the PCD as I incorrectly thought it would work for all values. (And luckily chose 0 which worked).
Here is a formal proof why no value of x != 0 works when n != m.
Suppose, all the row sums and column sums are x.
So, Sum of all cells in the grid = x*n (No. of rows * Sum of each row)
Also, Sum of all cells in the grid = x*m (No. of columns * Sum of each Column)
That means, x*n = x*m.
But since n != m, It's true only when x = 0.

[@samarpitagarwal7555]

I was having the same doubt during contest I took 1e11 but it didn't work then i luckily took zero it worked,but did not understand the intuition behind taking zero but now it's clear.. THANK YOU

[@PrimeeeeeTie]

this was the logic I was lacking

[@shashwattripathi4518]

can u explain last sample test case of scarecrow in detail

[@jatinsoni1979]

​@@BoredToDeath2357 see the question itself says that there can be multiple solutions (probably hinting towards the case of m=n) but we can say one thing for sure that x=0 would always work regardless becuase of the way the path moves, i.e downwards or rightwards. becuase the path movies only downwards or upwards it is always possible to make all row and coloumn's sum as zero, hence x=0 is always one of the answers for sure in any case.

[@PrimeeeeeTie]

@ i think input arrays would be such only that they give solutions

[@hi_guys_wassup]

Bhalo explanation diyecho sob questions er 👍🏻

[@notpersonal987]

very clear and nice explanation sir

[@hhhlll-l4j]

Great explanation for problem D.

[@manoor0858]

for first question i calculated difference in their position if its odd print no else yes

[@dysfunctional_ape]

thanks tle hit pupil in the contest

[@Travel-s5e]

worwst contets for me
i wan only able to solve 1 question gneerally i had solved 2

[@manoor0858]

sir how can i access the zoom meeting??

[@TLE_Eliminators]

Please fill the Feedback form for PCD: forms.gle/8m1bVCzwLqvkDZ23A

[@hemant_kumar_071]

Guys can you tell me the name of website where we can see rating of the contest questions

[@Travel-s5e]

clist

[@hemant_kumar_071]

@@Travel-s5e Thanks

[@SatyamKumar-m4z4s]

Please don't allow these disturbing elements to interrupt in between your explanation. He is just creating disturbance and noise for the others and nothing else.

[@akshaybhasin5778]

I solved A problem like this:
int main()
{
int t;
cin >> t;
while (t--)
{
int n, a, b;
cin >> n >> a >> b;
if (abs(a - b) % 2 == 0)
{
cout

[@JohnDoe-hl2qm]

same

[@imPriyansh77]

same

[@AppMaruf]

Wonderful PCD Soumojit

[@freebookstore3242]

thx for the upload

[@TanmayMankar-26]

From c it was exponential

[@ankitghanshala7382]

bhai C kis rating ka tha meri 950 rating hai div2 c nahi hota 😢

[@nishanttyagi3665]

@@ankitghanshala7382 around 1400

[@master_26_10]

Worst contest for me in last 3 months. Dropped from pupil with -51

[@umangkumar3459]

You will improve just don't quit

[@imPriyansh77]

Yes!! Worst contest for me as well. Got -72

[@ayaaniqbal3531]

If you are pupil then why are you giving Div 2 contest ?

[@VarunKmr15]

@@ayaaniqbal3531 brother ngl if you gonna think like this you'll hardly improve.

[@ayaaniqbal3531]

means i should give all contest without regarding my rating ? by the way thanks i was not knowing that .