I can't think of a single good argument for the trusted participants system , what is the point of not showing them on the leaderboard but still hvaing them impact your rating. I'm not saying they shouldn't impact your rating but that they should be shown on the leaderbaords.

Do we have any clue when the next rating rollback will be? Its been atleast 3 contests since the last one.

Why is there a bug in which friends standings and common standings show different placements?

In your opinion , is it better to refresh a problem to see if its AC or to move on to the next problem. Now , for the later problems time doesnt matter that much , but its really a different story for AB. So , what do you think?

The time has come , im now specialist which means i officalially cant participate in div 4 rounds. I have to say im surprised how fast i got here , 2 and a half months ago i just got to pupil and it took me 7 months.

Just look at my rating , why?

In yesterdays Div 2 C a part of the solution required to divide factorials. Know you might think that that is easy , but ofcourse , there was just one thing screwing everything up , mod 10^9+7. Just one number ruined everything. And thats why im asking , how to divide factorials properly when you take their mod first?

What are some other great websites with cp contests. i've heard of Atcoder and Codechef but which is the best(besides codeforces ofc)?

Lets do the following: write what inspires us to do cf. This way we will for sure inspire those who dont feel that way. I'll start

Is there a way , or an extension ,to see who has you as a friend. It just displaying the number of people seems not as useful.

So the problem is as following: You are given two integers n and q , and there is an array length n with all zeroes. There are q operations of 3 types: -output the sum in array a from i to j; -a[i] becomes 1; -a[i] becomes 0.

I know this can be done using segment trees but I think that is complicating it.

On the 21th of July 2023 i was my first participating in a contest. 209 days, later i finally reached pupil. This is without a doubt my biggest cp achievement. I had times of doubt that i would ever reached pupil but that is no more. Id like to thank MikeMirzayanov for creating the best place to practice cp. Id also like to thank my friends for motivating me to reach pupil and introducing me to Codeforces, BigBadBully Alebn jovnoliver12 naneosmic.

How many of you reading tuis are preparing for an Olympiad , i assume the nhmber is high because my friends and many people who competed in EJOI 2023 did. Also , if you are preparing for an Olympiad , which one , i am preparing fro EJOI 2024.

Do resubmissions only affect your placement if you solve the problem or does it not have to be solved?

What really excites me about this year is how passonate Moldova is about hosting EJOI 2024. They already made the website, IN JANUARY. And its going to be earlier than last year , 16-22 August. I think this is a good sign for cp olympiads in general and this motivates to work hard the next 7 month and reach first of all pupil. I hope you got motivated simillarly and good luck!

Is there any website like codeforces but for math? I need to work on my programming math.

This is a MUST HAVE for cf , i tells you much information about your acc , for example , your submissions each day , how many problems of what difficulty did you solve etc. Here is the link for everybody who didnt know about it already , https://cfviz.netlify.app/;

A few days ago i stumbeld upon a 1200 which gave me a headache 1822D - Super-Permutation , and just now i solved it. What i want you to do is look at this problem and try figuring it out , then read the rest of this post.

The way i solved it , and what i believe to be the easiest way of solving it looking at last test case and finding the pattern, after this you should be all set , the implementation is really easy.

This problem taught me that i really need to observe the test cases more , even if there is really only one useful test case.

Enjoy the rest of your day.

Recently I have been struggling with 1200 , i dont know what happend but i used to know how to do harde problems , i dont know what happend.

Is there actually any way of seeing lets say test case 91 , because usually it just shows like less then the first 50

For anyone looking to increase their rating and overall cp abilities i suggest checking out ACD Ladders , its completely free and will help you progress.

https://mirror.codeforces.com/problemset/problem/1851/C , this problem has been the sooooo confusing , can someone explain test case 9 to , but please dont spoil me the problem solution

I recently learned that instead of grinding lets say A problems you should go out of your comfort zone . Dont just do all the 800* problems you find , sometimes try 900* and 1000* and i guarantee you will get better.

What is the time complexity of the Euclidean Algorithm? Also please upvote im really down bad with the downvotes and i want to return to positive contribution. Edit: When i meant the contribution i was hoping to get massivly downvoted.

While its well known that ChatGPT is bad at solving cp problems , its rather infamous for all the other good regarding cp. For exapmle, you want to learn mergesort , while you could go on yt to try to find a good tutorial and explanation,you could just ask chatgpt for the code and explanation, he will also answer all your questions.