ig solves are 1000+ cause question being implementation heavy doesn't bother ChatGPT.

looking at your problems rating distribution, you have barely solved any good questions in proportion to the number of questions you have solved, it's all under 1300-1400 rated, ig start solving questions atleast +200 than your current rating.

I've not used bucket sort, looks like I'll get cooked in system testing

You need to know how to get number of different solutions to a equation of form x1 + x2 +...xn = r, after that the question becomes pretty simple.

MathCoder

checking adjacent values is enough ig, you can never have a subarray of length three or more which satisfies the properties.

And actually, Contradictory to what you said, I feel chess after 2000 starts to get boring, at that point practicing and learning theory starts to become a chore, and for that reason it starts to get pretty boring. Left chess cause of the same reason.

Was 2000+ rapid on chesscom, The best thing you can do is find people offline to play with, is more fun also, otherwise there's no other way round this frustration. People have the tendency to cheat no matter what platform or game.

Read the editorial once after you've solved the question, You'll surely find a better and neat implementation.

Hydrogen Bomb vs Dying Ant ahhh c1-c2. Regardless, very cool problems.

Assume two variables, storing max subarray sum ending at the current pointer, one of without selecting some b element, and of with some b element selected and apply something very similar to the standard algorithm for max subarray sum.

Idk bout others,but b was significantly harder than c, I solved c in 20 mins of seeing the question while b took forever. Whole time i was trying to split even Freq numbers manually in such a way that they get split into two odd parts.

I have only solved two sections, Introductory and The searching sorting one, and both had many repeating patterns that come in div2 B, C, specially the searching sorting one. So I think you should solve atleast those two. Don't know about others sections though.

I like how it takes you half an hour to solve C, 20 mins to solve B, but you take 5 mins to solve G.

As a participant, I did follow ;>

There are ample in IITs that cheat, and many in tier 3 clgs that don't. It's more about the person than his college or jee rank.

finite resources

So much video data would actually be very stressful on the servers.

Me too, eventually decided to just submit and check.

Capybara

i did the same, but unfortunately got hacked.

Paper 2 C can be done even more simply,We assume T(x) as number of ways to get a string of lenght n with T at x position, and similary we define S(x), then S(x) will be T(x-1) and T(x) will simply be number of ways of placing s on x-1 and x-2, meaning T(x) = S(x-1) + S(x-2).

True, i too was confused until i saw the examples.

You say neural network, but derive this for a simple linear regression case, whereas in an actual neural network the loss curve is very complex and this method will complicate the computations, by introducing the need for computation of second derivative. In case of simple linear regression, you simply got lucky, that newton-raphson gives exact solution for the equations.

I still couldn't do it tbh, it is a little tricky, atleast by the methods I was trying, and the target audience is also div 3 peeps, so I don't mind such questions.

Brother what will a div 1 participant do in a div4 contest even as unrated.

in such cases you can simply use, upper_bound and lower_bound, that saves a lot of coding time, and is also easier to debug with them.

I didn't know I had the tendency, but after giving the contest, I sure have one.

I like to do things one step at a time, for example, i first print any vectors involved at each iteration, then check what's going wrong, slowly checking involved data structures works for me most of the time.

It's not hiding, my point is trying to tell you have the open mind to listen what "people" have to say, this is not an eutopian world where everyone will have same opinion as you. Also what do you want, if someone is a cheater and is with a good guy, he can't even be suspected? Cmon!

See when I say people, I'm referring to myself from your pov, I'm not related to you in away so I'm a random person, therefore I used the term people. Also The guy you're saying has published paper and the person accused of cheating are different, I never said that aryan cheated.

Naah, the contest was public, cheaters who cheated, cheated in public, the platform is public, so Imma give my opinions publically. Also someone who is cheated in past, if it was exam, then gov bans such peeps fir re appearing in future, if it was in relationship, people will always see them as an unloyal person. It's not if you cheat again or not, the thing is if you've cheated in past,you will always be looked upon as a potential culprit in case things go wrong. It is 100% a possibility that you might have had nothing to do with it, but you can't erase your past.

Brother I am not ignoring any reasons, the reasons are valid, all I am saying is people will obviously suspect people with a bad past. And no people have not started to understand it's seriousness, you too know how many clg students cheat to boost their ratings before placement.

Also to me someone who has cheated in the past will always be a cheater. Anyone whose cheated in past, whether in competitions, exams, relationships, anything, they will always be considered a cheater, if you don't think so, then it's your pov I don't mind it.

Naah, before the contest started I wrote many positive comments too, ill obviously comment what I feel like, obviously won't fabricate my thoughts.

See he is my senior and I was very happy initially when the round was announced, you can check my previous comments. But the thing is,He couldnt solve a question in a recent question which was not solvable by gpt, some other user pointed all that out, also earlier everyone was denying that he even cheated in first, now you all say he cheated 2 years ago. In 2022 in a similar contest organized, by one of the other clubs on my college, one the question was plagiarized, So when this contest had sudden surge of cheaters there are could be only two reasons, problem leaks or very gptable problem, and seeing the history, I think it's normal to consider both cases.

Ohhh, i too saw that but missed the fact that for 2n-1 and greater numbers I could use recursion. Thankss now I know I was atleast thinking in right direction.

Got tle because of that.

I found a very simple pattern for C during the contest, the answer will be simply the m-n th iteration of bubble sort on 1 2 3....n, but couldnt manage to find a way to get to that in less than O(n^2).

Also the grimoire of code contest you've mentioned, that too is a club in IIT KGP similar to CodeClub which organized this controversial contest. The thing I'm trying to state is that I've seen many IITians trying to cheat their way into such things to continue the excellent academic past they have, I am also student of same college but still if I'm against my own of my own alumni, then there's some reason for it, such people also damage the reputation of my institute.

When a crime happens, the police first looks up the first suspects are the ones related to crime and with past history of wrong doings, it applies to each and every domain. Like I said and have been saying "suspect", so even if you might be innocent a bad past will always have you in the wrong spotlight.

See your point is correct, but if someone has a history of cheating, don't you think its normal to suspect them in future in case something they're involved in goes wrong?

True, the problem is the cheaters, whether it be among the participants or coordinators. But is now diverted to racism.

Both are wrong, specially the fck india guy should be banned, what he is doing is not revolt against cheaters, it's just pure racism.

He has two skipped contests, and we don't know how many did go un-noticed. I've got no problem with your part i.e. of problem setting, except letting a person with not so good history be a coauthor. I know you have attachments with the guy irl, so I dont even want you to publically accept that he's cheat and trusting such a cheat might've turned into a bad idea.

Yes obviously it is, Red is like CEO of a company, he need to be able to manage 100 things at once, while the problem setter is like head of some department, he just has to focus on one domain, and he just needs to be good in domain he is.

All of these have privacy issues, and I wouldn't want to give my camera access.

Ohkk, thats quite reasonable.What about the fact that blog quotes, author is here to enjoy cp and not boast his ratings, Then why does he allow someone who is cheater, who is here to boast his ratings and make cp less enjoyable, be his co-author? And why would anyone trust such cheater, that he might not have leaked the problems to fellow cheaters who too wanted to boost their ratings? Cause I know such dudes all they care about is getting a rating at which they could get shortlisted in some MnCs screenings.

I like how you know harshith_04 is a cheater, but you still stay diplomatic to not ruin your relations with your senior. Also the issue is not a specialist framing problems, the issue is cheating, if the contest was leaked before hand.

problems were fine, they are not the issue.

You're no different, infact you are one of those cheaters.

you forgot to include 3 itself.

Yeah, this guys is most probably a cheat, many a times he is unable to solve past 2 questions in div 2, which is easy even for specialists.

also I myself am just a newbie, and I don't practice I just give contests, so It would be better taking advice from others regarding practice.

start giving contests, you've given like 4 contests in total.

I saw your profile, considering you still can't solve B problems of Div3, I'd say specialist is very unrealistic target. Depending on the time you have you can reach pupil though. Best of luck anyways.

In cp what AI does to learning is exactly opposite of what boost means.

Will other people be able to see who got extra time?, also ti might be useful to add a "reason" section for other contestants to see, So that they know why someone was given extra time.

It's the first time am seeing someone with a negative rating. It deserves some seperate tier.

You cheeseburger people don't even have a fkin cuisine of yours.

Send the organizers to Hijli Detention Camp. PS: by organizers I mean the cheaters among them

Actually no point solving 100s of problems, you've already done that and can see the results. Focus on concepts, patterns, recurring themes. Try to learn as much as you can from each question, for tha solving 5-19 questions, a few ez, some medium lvl, and some hard, would do the job.

Hoping to solve 5 questions for the first time.

that's what i was thinking, what sort of outliers are those.

I think you should start praciticing specifically, Practicing so much but still being stuck shows you're not learning properly. Maybe make a list of begginer topics, and solve 5-10 ez-med-hard problems of each type. At the end you should be able to solve basic questions atleast.

On paper draw and try placing tiles of 3x2, you'll realize there's a thin alley like area between tiles that keeps forming, which you can't fill with 3x2 tiles.

pretty tough contest, D trapped me making me think i might get it, though couldn't think of anything except bruteforce in c.

Cses problems set helped me lot. I don't practive anymore, but I solved first two sections and it made quite a difference.

Hoping that this is the last time ill be hoping to reach pupil.

This path will only work on your own pc.

Never trust examples, examples, from what ives seen are always misleading

shame that iitd peeps have to cheat nowdays.

I mean when you use the integer with some ll quantity during multiplication, addition and all, it behaves like a long long number, otherwise using 1LL is the only way, it doesn't take any time also.

actually strategy is flawed, there could be a solution sometimes when you have to set only a few bits of some number, for that notice that adding 1<<x, where x is the unset bit is the fastest way to set a bit, so simply keep track of positions of all unset bits, and then sort them and subtract one by one from k.

Hopefully i'll get there next time. ＞︿＜

couldn't even try d properly, only 20 mins were left.

Hopefully i reach pupil after this contest :)

It's normal dw.

Ratings will update after system testing in a few hours.

C was way more challenging than D. Maybe that's cause I tried bruteforcing C.

I hope.

I don't get why people downvote such posts, he just wants help if someone knows something regarding the topic, they may answer the query, otherwise they can simply ignore or upvote for reach, But instead nowdays people just downvote such blogs, He has a asked a genuine question and many begginers like me will get help if such questions are answered. Plz stop such toxity in community.

It was a very good round with pretty tought problems and a lot to learn from. You'll did nice jobs making problems and conducting the contest.

actually if you get the logic of B, then it seems very easy, but even after that you have to take care of overflows, modulo etc. which makes it tougher than A. Also anyone with patience can solve A, by taking multiple cases.

Comparing modulo instead of actual values.I too made the same mistake

maybe its just the wrong place to ask, under someone else's blog :)

maybe he didn't read after "is that gay", hope you got the answer

Why so many downvotes? :)

Hope to solve 3 questions for the first time in a div2.

bro how is not performing good in your first contest a failure, don't romanticize things and keep working hard.

Broo how many alts do you have-_-

See first understand, if any binary string is there, swapping any two digits can change the number of palindromic pairs by either 0 or 2. Take few examples and try to wrap your head around this fact. You will understand what they are doing after that.

In similar boat, so would love to see suggestions.

Last time answering you. 1. Didn't work day and night to get into IIT,it's a college not a Nobel prize of something. 2. Asking for guidance is not crap, cheating and then trying to clarify with meaningless arguments is crap. 3. You yourself know how many times you've used LLMs, I don't have to prove anything. 4. Stop cheating, it will help you in long run, you have a lot of time in your hand, solve the cses questions set, slowly you'll gain good knowledge of dsa.

Your 13 year old dumb ahh really thinks I'm dumb enough to accept your crap, In case thought max_count will take for time than mc then why tf did you non simply change one variable from max_count to mc, any human would do that only. Am not talking to you no more, You yourself know what you do and what you'll again do in future contests, just saw your submissions you can't solve A questions of div 2 contests and now you're here suddenly solving 3-4 questions each contest. Plz don't waste time of others by posting crap on cf.

https://codeforces.me/contest/2110/submission/321110797 this is your submission three, where you copy paste the code from some llm, and think that searching and replacing the variable name with some random things will save you.

In the second qeustion of the contest, suddenly how in the middle of a contest you come up with new method to take inputs, you feel by putting random comments in your code people will not be able to guess if the codes are llm assisted or not?

See as you said you cheated only in one contest 1025, But checking submissions of 1026, It seems clear you were using external helps, First of all in Questions A, you tried solving it somehow, and then copy pasted an AI code, then tried changing variable names, but you dumb ahh forgot to change all of them, which got you runtime error after which you changed the variable names and submitted.

Usually the people admitting to cheating a few times, are the ones who cheat more often and want to get some of the guilt of their chest, Hope you don't keep going on this path of cheating in contests as it is not going to help you in anyway whatsoever.

O(1/n) would mean, in worst case scenario the time taken will be inverse of n, which itself is wrong, as then it is not the worse case scenario. I am saying this assuming the normal definition of big O used which is the worst case time complexity.