I think creating DS and Algo problems that are completely new and of difficulty level Div2 B,C or so is hard. There are many of them already existing in different OJs.

How to solve F ?

I am sure nobody likes to see this.

Bro, according to my qualification, i can only test sugar in coffee. But, i love the idea.

Now as a predictor, i want upvotes.

Official editorials of the problems may be a good idea.

()

If you do not participate in the contest, it doesn't matter.

thanks a lot brother.

I did so inside my update function. Inside the else if block Where I updated the tree node as
t[node]=combine(t[node],val);

I couldn't find the bug in my implementation of segment-tree for F. Please help. Code

Thumbs up

![ ]()

Ashishgup authored 6 contests and already number 5 in the top contributors list. That shows the quality of the rounds.

Thumps up for high quality descriptive editorial. By the way, in number c "The sample picture was a red herring". I stepped into that trap.

So that we can have a short contest of commenting about the delay.

Scoring distribution: 500 — 1000 — 1500 — 1750 — 2500 — 3000 — 3500 — 3000+1500. Actually, I am not clear about "3000+1500" part.

You got many upvotes (including mine). Because you are Errichto.

Kudos. " You really went for it in the last Educational Round! We had an all-time high participation of 21750 people "

Huge participation indicates more people performing home quarantine.

![ ]()

The round coincides with (and is based on) a local Saratov's olympiad for high school students. Any delay there will also reflect here. It can be a possible reason.

Is it possible to solve problem E using DP (DP is not there in the problem tags) ?

For those who may want to take part in both rounds.

All three having unusual starting time.

Was eagerly waiting for the editorial. Thanks.

May be they have some issues

Waiting for the editorial....

You will not be lucky enough to see someone in No.1 spot in top rated list except tourist for long. Congratulations ! Benq.

Thanks. Can you demonstrate how to attach a picture ?

Problem B What kind of problem is this? For input: 3 6 0 0 0 0 0 0 0 0 0

For the same code output in my system: 1048 CF say participant's output: 0 My submission link

Thanks for the detailed and descriptive editorial. All the editorials should be like this one.

Using ceil( pow(base,exponent) ) worked for me.

Problem C was interesting. I solved it using segment tree. Saw some others solving it with DP and some with cumulative sum technique .

I had registered for the contest . but during contest it showed i didn't register for the contest and thus couldn't submit solution . Please , Codeforces solve these type of problems soon.

Can any one elaborate the solution of problem 1164I — maximum value please . How to transform the equality (a+b−1)2=ab+1 to obtain a2+b2=4−(a+b−2)2≤4 ??

Many of Division2 participants didn't have any idea about interactive problems (I am also one of them). Because usually div2 contests doesn't contain this type of problems. To know and learn about them all on a sudden in a running contest is taught and time consuming.

Authors should have announced that there will be interactive problems in the contest beforehand.

How can i submit my answers now ? When I am submitting , its showing " You can not submit answers after the end of the contest. Please register for practice to submit answers ". Please someone tell me how to "register for practice" .

Please point out the 5 pairs. TIA.

Good decision to announce the contest as unrated .

And to learn , I guess.

By optimization, does it mean time complexity and memory complexity optimization ? If so , then a solution code for the problem will be given . Am i right ?

I think skill of problem setting will definitely help to improve the skill of problem solving . thanks a lot for the post . :-)

tnx. but unfortunately i unliked your comment . :-(

if i do not lock my code , than it is not hackable . am i right ??? or is it hackable ?? ( i am beginner )