i dont know why so much hate but everyone has different story. you simply dont know it ofc i might not be as capable as you and yes am not. but the point is despite all that i wanna do this i wanna enjoy every bit of it. the only thing i lack is that i annoy too quickly and i dont have the speed cf demands for. but nevertheless i want to go against the odds. this post was never meant to say am very good and still cant climb 1400. i dont expect admiration or kinda good words for me i just expect to not be hateful. is this how you behave in general?

thanks :)

i enjoyed edu round lately this year and rounds of intellegent and reirugan

when will the winners announced? i saw rating got updated

certainly!

see you should not calculate individual i ,j and k rather give some importance to gap sequence like 0,1,2 ..n-1 what i mean is if gap of 0 for a and b exists then for a and b 1,1 2,2 and n,n all exists now it makes sense to see a<b and b<c in a separate way so i tried a little combinatorical approach proving that a<b choices and b<c choices are independent so why not multiply them and eventually multiplying with n cause if one gap is valid then total of n new pairs gets generated

please visit mine for "c" i feel i have solved it very clean and without dp

prady is orz great tutor great cp skills !

house of red's!

the whole next day will be gone well because of the joy that i could explain my approach to a candidate master :)

for a given mod if it is high enough then it should be paired with as small q as possible and the y should be (remainder+1) from that we can conclude that for a given mod in descending order we should consider q in ascending order if for a given mod it can be paired up with q then we should use that q and move right and if we cant use that then it can be proved that any bigger q cant be satisfied even as x will be remainder +((remainder +1)*q) so it will be better to leave that q for a smaller mod. pleases go through my code once to understand better

if you look it is very simple once you get a simple math observation (that observation too is a maths fact only)

clist states it is around 1298 so it is 1300 i guess.

a @reirugan round ? i wish it will be as good as your previous div3 round !!

bhai come to my clg for masters together we will make that happen !!lol

I would have got my rank upgraded but anyways contest was actually goated. And I could have avoided checking evens as they can get paired up with anyone in 1 in that case too this can pass

Same bruh but what could be the reason

my best performance in d2 got in vain

look at mine i used approach that rotation is better like max is sum of n and we can reduce that by rotation i feel mine one is somewhat does what you want in o(n) almost https://mirror.codeforces.com/contest/2120/submission/335760194

honestly cp wouldnt have been possible for me without Tle Eliminators priyansh !! kudos to the team !! thanks for everything!!

though i handled d=0 separately, but was solving it little greedily. which costed me (was having ac*24 and wa*rest)

e is the best bs + greedy question i have solved so far

the same div3's d was the reason i could solve edu c

i cant describe how much you helped me ! thanks man

in that case read a book named siddhartha by hermann hesse do read it. it is by one of the best writer in the world ig can help it is your decision now to read or not but i can say that whenever i dont get any hope i read book or do exercise like cycling and all. but the solution of your problem will come from within that is why i strongly suggest that do read it is the only way in my understanding and do read meaningful literature. i believe it will help to find the cause.

are you interested in reading? if yes then i would say do read some philosophers like jiddu krishnamurthy,harman hesse etc . dont worry it is not about religion it is about understanding life, the mind, the body i feel it would help if you're interested i can suggest some good books.

ignore them we know they are intentionally doin it