Comments
0

DW bro, I will give the contest with the same zeal. I feel your sadness but don't forget that unlike most of us, you have at least been a problem setter. Ecrade_ orz.
On BledDest → Codeforces Round 995 (Div. 3), 22 months ago
0

lol. might be. might be not.
On BledDest → Codeforces Round 995 (Div. 3), 22 months ago
+5

I hope to get rid of this color in this contest. Best of luck to yall too \(^~^)/
0

3 contests se downfall ho raha hai :(
0

"Touch some grass" and "Cyborg" from my sid3
0

wapis blue banna hai mujhe.. (hopefully)

On cry → Codeforces Round 965 (Div. 2), 2 years ago
0

aaj speedforces hoga kya bc :D
0

yeah, maybe they can make all contests rated for everyone such that the high rank holders don't affect the new comers that much.
0

Can someone suggest me some source for

$$$dp$$$

questions on codeforces so i can practice and learn??? I'm really afraid of the topic and want to overcome that fear.
0

build logic as fast as possible. moreover, i had done 230 questions on my previous id but had to stop it and made this new one. i was solving for quite a time but only from last year or so i started giving contests seriously. trust me problems <2000 are not hard. i strictly believe that you should try your best from your id only as you will be fooling urself. try to stay thinking fast, learning concepts, seeing code of top ones etc. have a zeal to learn. don't give up. choose discipline, not motivation. peace.
0

I hope to not become pupil again. I wish the problems to be interesting. I wish there were a round based on specific games and the problems have a story of the game. (Imagine, "Kratos has brought n deers and Atreus wants to eat them with maximum weight first...would be so awesome xDxDxD)

0

I think for A, a simple proof (or rather intuition) can be : Let's say you do not divide the element into (k-1) 1's and (n-k+1), and lets say you divide it into some number (possibly zero) number of 1's and a bunch of other numbers. Let the minimum number be p, then, to make p into 1 again (which is our goal), you'll need another operation in the future to convert it. Thus, you are needing more than 1 operation to convert a number into 1. Greedily, we should ideally use only 1 operation to convert a number (or part of it) into 1's. Thus, the ideal strategy becomes to convert the numbers into (k-1) 1's and (n-k+1)
0

I hope to go forward and wish for this to be the best Div3. Odin is with us!!!
0

but i need them differences sorted
+1

i tried storing the increasing differnce of a[i] — b[i] (and consecutively increasing a[i]) in maps but am getting TLE.Can someone tell me why my time complexity is getting f-ed.Can someone also tell me the optimizations.my submission :((