look, first of all please note that this technique might not work for you but at least for me it somewhat worked, you need to just solve some problems about your rating by a little bit and when you think you are ready for something more specific lets say binary search go and watch the EDU or any place about it , solve couple of problems about it ( lets say 30 ) and then whenever you have a binary search problem in a round you are participant in that is not that hard considering your rate it will be easier

TL;DR : just solve some problems about your rate by a little and every now and then go learn a technique

(turning on notifications for this comment).

C was way harder than D for me , i dont know if its me or the problem.

Thanks Numb and anno

sorry if i wasted your time with my -3 IQ.

and if there a test case where input is

1

XS

XXXL

how can a code like the one i described be good ?

((sorry if i just misread or didn't understand the problem))

maybe i should be saying sorry for this question , but can someone please explain to me A and why n — (all the sizes that are the same in old and new t-shirts sizes) is an logical answer ?

does D need dp ?

""A, B, C was too easy and C, D, E"" i geuss you meant F D E and thats actually true , they are harder than most B's in div 2

i know about it , and i have it ,but that does not mean all of my problems(a,b) will be accepted.

when will the rating changes happen ? (sorry for bad english)

same