Finally, an unrated div3 for me!

The first step is knowing that u can't use 'an' before words starting with consonants

I remember thinking about its solution last year for more than an hour and couldn't solve it. Smiled when I saw the solution.

people on their way to post this meme hoping they will get some upvotes

In D, in last line, I think it should be max not min.

Congrats, keep grinding and you may become specialist in a month or two. You've practiced quite well in last few months.

yes..

oh c'mon, you are a lgm. Just solve all :)

Last year i became expert, i was a newbie on jan 1 2022. Goal for 2023 se to reach 2000 rating.

Thanks

I have a delta of -201 from last 5 contests, don't know how much time it will take to regain these lost points.

just keep solving +100 or +200 from your current rating, give contests as much as u can and always upsolve after contest ends. nothing new.

You surely can if you work enough. I had a max rating of newbie on jan 1st 2022, now i have a max rating of expert.

Achievement: Went from newbie to expert in 2022. Target for 2023: Reach candidate master asap.

how to solve d?

how about changing thw world cup timings:)

how to solve B?

if n is odd print 1 1 1 1 1 1.... else print 1 3 2 2 2 2 ...

yup

because it has more than 1 valley. one at value 8 and another at value 4.

solved all problems in div4 for the 2nd time. feels amazing.

how to solve D?

can someone pls tell whats wrong? don't know whats wrong. I have done similar to what explained in editorial. problem: SQUARESORT link: https://www.codechef.com/viewsolution/79565377

download your certificate. put it into a folder in your google drive and share its link wherever you want. just make sure it is public and not private.

mine is also not showing for Round G may be they have reversed it temporarily.

You couldn't solve it doesn't mean the problem was bad.

Also, when we open standings, can we directed to friends standings and not common standings because most of the times we are interested in seeing our friends' performances first.

solve 1000+ problems in total on cf and reach expert.

yes please postpone global round, we want to give both contests!

yeah many of them are n*n

just try setting n to 2e5 and all values to 1.

may you get your answer only after you tell me how to reach expert.

for problem B, why does this gives tle https://codeforces.me/contest/1730/submission/173459830 while this passes https://codeforces.me/contest/1730/submission/173475885

then please suggest me something.

In D, answer will be 0 and not -1 when no groups can be formed.

you need to increase the size of array. notice n<=2000 but you have declared an array of size 1000 only

As we can see in the input list, 3 is not one of the stations where the train stops.

first of all stop practicing problems which are rated below 1400. You have solved a hell lot of easy problems. set a rating range of 1400-1600 or 1500-1600 go to page 2 or 3 and just start solving each problem line by line. This worked for me.

whats wrong with this https://codeforces.me/contest/1692/submission/160657931 P.S. found.

someone pls find failing testcase for problem C https://codeforces.me/contest/1689/submission/160135619

but it s not written that sum of n over all test cases will not exceed 200.Does that mean that in a single input set, there could be 1000 inputs where n=200?

the optimal strategy is to wait until we have greater than n seconds left and let the mushrooms grow as much as they can. finally when we have n seconds left, we traverse over the array and collect all the mushrooms.

Hi, i think i have done something similar. don't know whats wrong https://codeforces.me/contest/1691/submission/159059179

solved D for the second time(last time got hacked). Hoping not to get fst today.

but where to find that option

whats the testcase? my d also got hacked. https://codeforces.me/contest/1681/submission/158189337

congrats for rank 7 in kickstart!

idea for d? and whats on pretest 32 in e?

Thanks a lot!

Pls help https://codeforces.me/contest/1660/submission/152302981 Thankyou

why this failed for B https://codeforces.me/contest/1656/submission/150765827

whats wrong in this logic for c ans is yes when:- 1. all are already equal. 2.arr does not contain 0 and 1(we can divide each number with itself to get rem 0). 3.if 0 is present, 1 is absent(0 and 1 cannot be changed). 4.if 1 is present,2 is absent(1 cannot be changed, 2 can be changed but only to 0).

someone pls help! https://codeforces.me/contest/1633/submission/144748512

Congrats for becoming pink!

preparing to win this from jan 1 (even before the blog was written)-:)

oh!

ya it is a mistake in writing only...the code is correct