### cschill's blog

By cschill, history, 5 months ago,

I was trying this problem — https://mirror.codeforces.com/problemset/problem/348/A

Its a simple binary search problem but it shows wrong answer — https://mirror.codeforces.com/contest/348/submission/235257891

I changed my high to 1e14 from 1e16 and its accepted. I am unable to understand what was the reason behind the error.... please let me know if anyone have a clue about it :))

Thanks

• 0

By cschill, history, 21 month(s) ago,

I stopped cp because of travelling and after that, I have never been able to maintain the flow again? I am getting really frustrated. Before I used to fight the questions and now if I am unable to solve them I just stop thinking about them. I am really getting frustrated and burnt down.

Any suggestions?

• +31

By cschill, history, 2 years ago,

I am very very happy today. After 92 days of consistent grind, I became an expert. I wanted to share my analogy of code forces with Cricket which is my fav sport ( and whole India's fav as well )

Take Contests as balls. Something you will get Yorkers and sometimes you will get bouncers. Just try not to get out, take singles and doubles {Try to maintain your rating} And the day you get the full toss, mark it as your day and blast a six.

Exactly that happened to me, I am good at certain topics and I am average ( for my rating ) in others

I have previously solved a lot of 1800's binary search questions.

Last Div. 3 I managed to solve the E problem since it was of Binary search. This Div2. contest I solved the D problem since it was number-theory based. Again a topic I am confident in.

The key takeaway, no matter how much you suck right now, doesn't stop giving contests. Your rating will go down, no problem. All you need is 2 contests in your domain. Just wait for them and don't stop the grind.

I pray that all of you also get to feel the same happiness as I am feeling.

Bye

• +234

By cschill, history, 2 years ago,

Hello, Some rumours are saying that it will be unrated. Please keep it rated.

And change the ratings asap, please.

Thank You

• -26

By cschill, history, 2 years ago,

Please bring back the Div. 3 contests, it's been quite a while we had one.

Thank You

• +4

By cschill, history, 2 years ago,

This is my short solution unfortunately I am getting a TLE. I tried to calculate and I know that it should be a TLE, since 1e6 * 3.32 * 6 * 20 > 1e8 but this is the worst case complexity and chances are it may never be reached. I have seen that other have written nlogn solution as well using binary search. Could anyone help me optimize my solution a little bit. Thank you very much https://mirror.codeforces.com/contest/1379/submission/146460768

• 0

By cschill, history, 2 years ago,

Hello Guys, Please help me, I am getting TLE but the complexity of my program is around O(n*logn + n + n + n + T) where n and t both are 5e6. The time limit is 3 sec. I think it should work. Please help. https://mirror.codeforces.com/contest/546/submission/145049261

• 0

By cschill, history, 2 years ago,

Hello everyone, In this blog, I have given some relevant logic on why you are stuck between pupil and expert. Please at least skim through the text once to get the idea.

I am a noob-coder so, don't expect some algo material in this blog. However, if you are stuck between pupil and expert and feeling sad (like I do) because we are not getting any motivation, as the hard work we put in doesn't correspond with the result, then this blog is definitely for you.

I started code forces in mid-2020, wasn't regular gave some contests that time, I had zero knowledge of any DSA concepts. Barely knew STL, and now I have done DSA and Advanced Algorithms courses in my college, in which I performed greatly. Solved all the standard questions of DP & graph. But apparently, I am performing worse than before, so I went to the old contest that I have solved previously in which I was able to solve A and B getting me to a rating around 1340, I was easily able to solve A, B and C under 45 mins. I realised some things have changed, or maybe it could be that I just got lucky with the C problem. Then I tried to solve the ladder questions rated around 1300 but all these questions are from 2-3 years back, and boom I realised that 1300 rating questions are just too simple for me. But again in the recent contest, I struggle with 1400 rated questions, how is this possible???

But, recently I read a blog of Wind_Eagle (blog link), which was about the cheaters in codeforces. This opened my eye, I dig deep into this cheater thing, and realized that the core reason a cheater is maybe because he wanted to gain a decent title of codeforces (for eg. EXPERT) that will help him/her in their Resume.

So, what might be happening that a decent rank coder says above 1700-1800 rate is there, I will call him the SuperSpreader.

SuperSpreader will solve a question during the contest and through cheating groups, he will sell cheaters his solution. Now, the only one that's going to affect by this is none other than a pupil or a specialist. The ones that are around the same rank of the SuperSpreader will solve the question at the same time as him and hence the cheaters won't affect them.

Conclusion: Currently, all the questions that are rated below 1600 are having highly inflated ratings. If you are at 1300 rating then probably your real rating will be around 1500, when your real skills will reach a stage of about 1800 then only you will start to see a significant change in your ratings. That means reaching the Candidate Master gap from an expert will now become way less than it used to before while reaching an expert will require a lot more effort. So, be strong mentally give old virtual contests for a confidence boost. And keep the grind on.

If you think it was logical, then do give it an upvote. Thanks!!!

Edit: In India, companies directly shortlist students having a title of expert in codeforces. Any Indian can confirm that. Having this as the only reference I wrote this blog.

• -36

By cschill, history, 2 years ago,

Hello, so I tried to solve the problem C, with an idea similar to 01 Knapsack. I realized that the memory limit may exceed since its 505 * 505 * 505 which is greater than 1e8, but then I understood my solution and cutoff the unnecessary space. However, I am still getting a MLE. can anyone please help me.

• +9