Comments
+12

The environment was really irritating. I felt like I was in remand.

Testcase of First Problem ( Digit mapping may be) doesn't satisfy its constraints.
+43

I found cf community very sadist and cheap minded. What is the reason of down-voting this post? You can discuss what you disliked in the app and what should be Changed. What is the reason of down-voting without any issue? Its just a reflection of poverty of your narrow mind. I've seen this many times in many posts and comments.
+22

The answer is in your comment XD The guy who cannot solve E,solved ABCD within 50 minutes! and no ds recquired till D! Neither a hard implementation problem nor any requirement of hard observation or ad-hoc logic till D -_- so you want to treat problem D as B in previous difficulty standard, Nice. Clap clap

-50

Below average problem set.

Cf standard going downward day by day
+45

Thanks a lot. But please make the problem statements clear enough and straightforward. Best Wishes <3

0

You can't apply the algorithmic idea(which is discussed in cf editorial) of this problem in the criterion's one.

0

not same , there is a change in constraints...

0

May I get some help about 112 No. test case of problem No. F ???

+5

A bracket sequence will be regular if, starting count from first character, for any position of that sequence, number of opening brackets "(" is more or equal to the number of closig bracket ")" ,and finaly number of opening bracket is equal to the number of closing bracket.

Now , if you want to make a regular sequence by concatenating two sequences , there will be some options

1.choose two regular sequence

2.choose one sequence that have n more opening brackets(here n=total number of opening brackets-total number of closing bracket) .and for any position of that sequence number of opening brackets are not less than number of closing brackets.and choose another sequence that have n more closing brackets than opening brackets (here n is similar to previous one).and for any position of this sequence number of closing brackets should not be more than n+number of opening brackets. now you can concatenate these two sequences in one way , 1st+2nd will be a regular sequence .

[Don't know how much I could explain , sorry for my bad English :) ]