Codeforces Educational Round 153 | Video Solutions - A to C | by Ankit | TLE Eliminators

[@TLE_Eliminators]

Please fill out the feedback form for today's PCD : forms.gle/oWbtPiSYMbxWwwit7

[@IT_AvishkarBorkar]

Keep doing this stuff, thanks!

[@deveshnandan323]

Very Nice Explanation , please try to include problems D &E solutions as well

[@Munnu-hs6rk]

can someone tell which contests are harder algorithmic wise rather than implementation educational or rated ones?

[@vijayanks1714]

In prb A what if s = (()) , in this case expected output is NO right bcz it is valid bracket sequ, but according to the explanation s =="()" this only print as NO other valid sequence goes YES eg, ()(), ((())), (())() pls help to clear this

[@vijayanks1714]

In contest I am implment stack to verify given seq is valid or not if not valid I go with YES and print the valid bracket.... BUT this lead to wrong ans in 2 TC

[@akshayraoch]

Same here

[@rhymes1717]

The catch here is that the sequence/answer should not have any substring s, means if s= (()), then the valid answer can be ()()()() because it does not have (()) as substring. And there is only 1 condition that is if s= )( , then only you the answer would be (()), else in every case you can have answer as ()*n. Hopefully it makes sense, if not feel free to ask more. Happy Coding!

[@Krishnash1355]

So we can print ()()()() as output

[@Krishnash1355]

And therefore the given string will not lie in the output string that is exactly what the question is asking.

[@Bharat_Rider]

9:10 null character ig

[@pratikkumar5086]

in Problem B what i did is int total = a * 1 + b * k; int rem = m - total; if (rem

[@abhishekjaiswal839]

What if a = 0 and b*k >m && (m%k)!=0? then it will print 0. But the correct answer is (m - (floor(m/k)) * k).

[@pratikkumar5086]

Got it @@abhishekjaiswal839