now, fast-olympic coding is working, but competitive companion and fast olympic coding hook not working.

Lots of contests(including virtuals) + Upsolving the problem which I didn't able to solve during contest (For div2 atleast till problem D and for div3 all problems) helped me lot in boosting up my rating.

Pass string s by reference string &s in the function.

Gross. >_<. I was not taking mod when adding f to final returned answer. Thanks. Your hint helped me in finding the bug.

I have used also the similar approach. Only 1 testcase is failing and I couldn't figured that out till now. Used stress testing also, but not able to generate that type of testcase.

Here's code. It would be great if you can help in this. Thanks :)

That was not required to say. like if the given array is [5, 1], [2, 5], that doesn't mean you will reach 5 before reaching 2. You should first come to 2 increasing your rate of speed to x + 5 and then you will reach 5. (Eaten burger count will always increase).

1)Sort the given array according to burgers count (that is p).

2)Do, binary search for the start value x, and check if you can eat all the burgers within the given time or not.

3)Update the rate of speed (x) when your current burger count reaches to p present in the sorted array. Then x become x + q.

4) If the remaining burger count becomes 0 then check if time taken is less than equal to C then return true, else return false;

Note — Take time taken in double.

short int t;

It is the issue. short int has range -32,768 to 32,767 and in constraint number of testcase is upto 50,000, which is greater than 32,767 causing runtime error. Change it to int. You will get AC.

Ctrl + A then Ctrl + D

Its weird that it passed. Thanks for the help.

Pls can somebody tell why this solution 142368820 for problem E is not giving TLE and what is its correct time complexity. I think its time complexity is greater than O(n*m*m) (not sure). Any suggestion will be helpful. Thanks.

Pls can somebody tell why this solution 142368820 is not giving TLE and what is its time complexity. IMO its time complexity is greater than O(n*m*m) (not sure). Thanks.

forgot password and change from signin page.

Agree. There was boom in the submissions of D after 1000 submissions.

Applying merge sort you can easily count inversions.submission

see my submission I did by storing right max.

You just need the count of 1s from left and right which are at distance e for making the subsequences with the prime number at index i. Here's my approach. 137280638

Because, many hardworking and deserving people are not able to reach their actual rank because of garbage persons like you.

I had put wrong link by mistake. Sorry for that.

See

for E tooo. (my code giving TLE after the contest.) can you please answer why this code giving tle.

Accepted.

TLE.

Just changed vector with array and now it is accepted. It feel very bad (T_T) During the contest my solution was accepted and after systest it gave TLE). First time I had got under 2000 rank. It was meant a lot for me. And now this happened because of vector vs array:|

PS: Do anyone know how to use vectors as fast as arrays?

PS: TLE code accepted on removing #define int long long.

PS: But, creating dynamic array example: int*m = new int[k + 1]; gives MLE. 131911303

PS: Global vector working fine.

By the way nice contest ^_^. IMO there should have such testcases during the contest so that we can correct this things during the contest.

Nice zig-zag pattern in this code made using only swap XD. CODE. Most weird code for me.

"Muh me ram bagal me chhuri"

Yes, if they can't clear their interview dsa questions, what will they can do with their 5 star or being expert. At that time there is nothing for them to have proud on rather than they will be feeling ashamed of themselves.

Don't waste your time on exploring these people. Cheating can't be stopped. If they want they will, until they fell/agree that they are doing wrong. There are 100s of such blogs already present. Do you think it had any impact. So, don't waste the time in observing this types of things.

Using memoization. Code

I had joined late. So i used that id, But too many downvotes. I am sorry. Now I realised that the questions were very good. That's my fault. I start getting panic when I failed to submit A which results in failure of B and C. I am really ****Sorry**** for the comment.

deleted

[deleted]

Test not working correctly except the timer! Not submitting on clicking after the 4th question.

Why downvotes, it wasn't needed. I just asked.

What does it means- " In the upcoming round, you can use only Kotlin. You can read the code examples here."

After seeing the problems I am sure why @antontrygubO_o rejected all your questions last time (that was really a nice story). Ok but as you told the questions were really interesting. "! But you should be in between the difficulty level of div2 !" Very first time I am seeing that the contest blog page upvotes are decreasing after and during the contest.

Got same problem. And now i am sure that i just banged my head by giving this contest.

Score for problem C is 750 so it means it will be easier than the problem B (having score 1000)?

deleted

Same, if you got WA then its very frustrating to think about.

From the last contest there seems to be less participation because of busy schedules and lot of assignments of college.

deleted

Close to 30k..!! May all registered participants give the contest.

deleted

Delay in the contest..!!!

skipped means what in codeforces. I hadn't seen it before. I saw in someone's submissions.

OK I corrected that mistake and now i am getting wrong in testcase5. Can you suggest where i am wrong. 99552525

Yes i noticed that but can you suggest how to manage that case..

Can anyone tell why my code giving wrong on test4?

99543593

deleted

Why its taking so much time for declaring results.