Comments

Seeing so much submission in d is just shocking and heart breaking, newbie using BIT to crack the problem some serious shit is going on for sure

+3

I’ve come too far to stop now! No matter how tough it gets, I’ll reach Expert this time.

it ask us to find the minimum cost.

the cost can sometime be infinite as we are performing the steps infinite times

On Queue[Invitation] IICPC CodeFest 2025, 15 months ago
0

Really excited

best contst in recent times, felt very very good after competing

hahahaha yup

I've read somewhere that sqrt and log functions can have precision issues at large values? I've never encountered an error when using them so far though, recently I have encountered that (sad).

On EvirirCodeforces Round 994 (Div. 2), 16 months ago
0

Yup exactly, i am thinking to solve 1800 codeforces dp problems from now on then only i will become good in such problems

On EvirirCodeforces Round 994 (Div. 2), 16 months ago
0

I suck so bad in solving DP problems, can you please share me best dp practice set apart from cses dp a problem/practice set with less no of problems but more to learn... plz

Do I have a chance ?

-6

worst c for me rather then preparing for tommorows exam wasted more then 1 and half hours on c

seems a great initiative

+8

Yess I know but still giving both the contest will always be better then participating in one

+11

A contest after so00 long but clashing with leetcode biweekly

I always get hints for problems rated high like D but don't know why I didn't able to solve the problems

yes I am also the handful one

today first 10 min my codeforces didnt run well

i think taking whole array will reduce the max sum.

3000+ solve on c and I am not one of those geniuses.

Doesn't creating a dp vector will take O(n * m * (MAXN + 1)).and this solution should get tle?? Plz explain

Literally it took me half an hour to understand what problem d wants to say btw thanku for the contest

Bhai how to be good at implementation based problems? Any advice plzz

how did you came across this test case ?

m v bhai, curious and angry at same time

-6

my last unrated contest

crying inside wasted all my time in problem c....... crying outside ...... i will become candidate master by june 2024

closest integer to 1.5 is 1 or 2 ? and why

a if condn was missing , now its solved . i aim to become expert by the end of this year , and do everything possible to acheive it

I have provided the link . My code is here plz this ( it is the link)

My code is here plz . this is my submission.

Used same approach but got wrong ans

0

I just checked for the extreme ends of string and if one end is 1 and other is 0 or vice versa then that means they are in correct position and we can forget about them , now we will have some new extreme points if the extreme points are 0 and 0 then it means we have to do something, so inserting 0 1 to last will help us and again after inserting we can remove the extreme characters, same for 1 1 but this time insert 0 1 at the beginning. I hope I was able to convey my approach

-15

i love solving observation problems like c , i just tried some cases and came up with the soluion .

i think i was tooo close to solve c. damn it , i will see it next time

I think I misunderstood c

WA on test 3 div2 B , its time for my mental checkup

+3

it feels so good after solving E.

Editorial plzz Mohit bhaya

And here I was trying to use recursion, when will you upload editorial?

i suck so bad .

b was all about how you interpret. if it would have been c, then everything would be great.

b was very tricky , i loved the problem but according to contest , it doest not fit for B

Binary search OP.

thanku for the editorial .

problems are amazing thanku everyone , i dont know why i am getting wa2 on div2/c

Where can I find editorial?

Why score distribution is 1250+1250 does that ques will have two part

Plzzz do it everytime, so that these cheaters will stop cheating because they are doing all of this for rating , and if there rating decreases they will stop doing it.

+2

i feel language was bit difficult.

indeed it was beautiful ,as a result i just watched those questions for 2 hrs straight

thank you codeforces for realising me that cp is not for me

Sorry ,but I feel A lengthy and language is very tricky