You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

 
 
 
 
1.

Geothermal

Last visit:  7 hours ago
Registered:  5 years ago
 
 
 
 
2.
By Geothermal, history, 18 months ago, In English
Remove Virtual Contestants from Contest Leaderboards As most of you are likely aware, cheating in virtual contests (typically by submitting prewritten or copied solutions in order to appear at the top of the leaderboard) is very common. Most recently, [user:wannabecandidatemaster,2020-05-28] submitted solutions to all problems in [this round](https://codeforces.com/contest/1358/standings) in order to take first place in the standings, and [user:bemandrei,2020-05-28] competed virtually in [this round](https://codeforces.com/contest/1360/standings) after competing in the round officially, and ended up in second place on the leaderboard. In response to the rise of VC cheating (as well as some other issues with the VC system I'll describe below), I'd like to make a simple proposal: **Remove all virtual participants from the contest leaderboards.** The one exception is that you should see your own name on leaderboards for contests you VCed (that is, virtual contestants should be visible only to themselves). Similarly, virtual participan...
Geothermal

Read more »

 
 
 
 
  • Vote: I like it
  • +1001
  • Vote: I do not like it

 
 
 
 
3.
By Geothermal, history, 2 years ago, In English
Gauging Interest in Training Program Hi all! I'm currently considering opening up a competitive programming training program of some sort. The details are definitely still in the works, though, and I wanted to discuss some preliminary ideas with the community to get feedback on what would be most helpful (and on whether there would be any interest in this). I'm interested in starting a training program for three main reasons: - To make competitive programming more accessible to those without access to resources like college courses or training camps - To provide a space in which questions are encouraged and actively answered (especially since I think this generally isn't the case in the community at large) - To help competitive programmers build problem-solving skills and intuition, which I think aren't sufficiently emphasized by most contest training resources I think one of the most frustrating things about being a new (or even intermediate) competitive programmer is that it's generally pretty difficu...
Geothermal

Read more »

 
 
 
 
  • Vote: I like it
  • +376
  • Vote: I do not like it

 
 
 
 
4.
By owopotato, history, 3 months ago, In English
hello guys i am back Codeforces | In English По-русски owopotato | Logout HOMETOPCONTESTSGYMPROBLEMSETGROUPSRATINGEDUAPICALENDARHELPDELTIX ROUNDS 2021 → Pay attention Before contest Codeforces Round #740 (Div. 1, based on VK Cup 2021 — Final (Engine)) 24:16:07 Before contest Codeforces Round #740 (Div. 2, based on VK Cup 2021 — Final (Engine)) 24:16:07 Register now » *has extra registration → owopotato owopotato User''s contribution into Codeforces communityContribution: -37 Settings Blog Teams Submissions Groups Talks Contests → Top rated # User Rating 1 tourist 3819 2 Benq 3745 3 ksun48 3560 4 Radewoosh 3511 5 Um_nik 3489 6 peehs_moorhsum 3460 7 Petr 3414 8 Miracle03 3410 9 maroonrk 3400 10 sunset 3338 Countries | Cities | Organizations View all → → Top contributors # User Contrib. 1 1-gon 209 2 Errichto 181 3 Um_nik 179 4 awoo 178 5 tourist 174 6 -is-this-fft- 173 7 maroonrk 172 7 Radewoosh 172 9 antontrygubO_o ...
Geothermal

Read more »

 
 
 
 
  • Vote: I like it
  • -32
  • Vote: I do not like it

 
 
 
 
5.
By Geothermal, history, 18 months ago, In English
AtCoder Beginner Contest 169 Unofficial Editorial I just did my first ABC in a while, so I decided to write up and share my solutions below. Feel free to leave questions in the comments! There were several questions this round that had the potential to create precision issues; however, the solutions below give approaches that sidestep those errors altogether. Sadly, I think compiling and testing my A prevented me from winning the round :( #A — Multiplication 1 Just multiply the numbers and print them out. It's not that hard. Time Complexity: $O(1)$. [Click here for my submission.](https://atcoder.jp/contests/abc169/submissions/13800320) --- #B — Multiplication 2 This turns out not to be quite as easy as the last problem. Multiplying numbers this large is actually a challenge in C++ because the result is likely to be greater than $2^{63}$, and thus will cause long long overflow. Thus, in C++, we can't just multiply the numbers and check if the result is greater than $10^{18}$. One possible appr...
Geothermal

Read more »

 
 
 
 
  • Vote: I like it
  • +281
  • Vote: I do not like it

 
 
 
 
6.
By Geothermal, history, 8 months ago, In English
Codeforces Round #709 / Technocup 2021 Final Round - Unofficial Editorial As the editorial for round #709 has yet to be released, I thought I'd write up and post my solutions to the problems (with the exception of Div. 1 F). My code may not be especially useful, since it's a bit messier than necessary in some cases, but I'm hoping that the written explanations will be fairly helpful. Feel free to comment if you have any questions! --- #[2A — Prison Break](https://codeforces.com/contest/1484/problem/A) By simply playing around with a few small test cases, you might guess that the answer is always equal to $ab$. This intuition is correct; let's prove it formally. Consider a graph with $ab+1$ vertices including one vertex representing each cell of the prison, one vertex representing the outside world, and an edge for each wall of the prison connecting the two vertices on either side of the wall. Then, observe that a set of walls we can remove such that the outside world is accessible from every cell is equivalent to a set of edges that s...
Geothermal

Read more »

 
 
 
 
  • Vote: I like it
  • +207
  • Vote: I do not like it

 
 
 
 
7.
By Geothermal, history, 2 years ago, In English
Teams Going to the 2020 ICPC North American Championships Now that the first North American ICPC regionals are complete, I'm starting a list of teams attending the North American Championships next February. To start things off, the list will include team names and ranks. However, please comment below if you know any of the members of the advancing teams--I'll fill in their Codeforces handles if they have them or their names if not. (To avoid leaking sensitive personal information, please do not provide someone's Codeforces handle if their profile does not include their real name and you haven't received permission from them to post their username.) Additionally, if you notice any errors, let me know. In particular, I'm gathering a list of schools by taking the top teams at each regional, but I may need to adjust this list if any teams choose not to accept their NAC invitations. --- #East Central | Rank | University | Team Name | Member 1 | Member 2 | Member 3 | | ----- | ------- | ------ | ---------- | -------- | -----...
Geothermal

Read more »

 
 
 
 
  • Vote: I like it
  • +184
  • Vote: I do not like it

 
 
 
 
8.
By Ashishgup, 6 weeks ago, In English
CodeChef Lockout #5 — Um_nik vs Geothermal Hi everyone. CodeChef will be hosting the 5th Lockout Competition tomorrow, immediately after the end of [SnackDown Round 1A](https://www.codechef.com/SNCK1A21). Lockout is an intense and fast-paced coding competition between two top competitive programmers, incorporating an esports kind of feeling in competitive programming. This lockout match will be between 2 top coders, who were also (respectively) the winner and the host of the [2020 Lockout Championship](https://codeforces.com/blog/entry/81395): - **Alex Danilyuk** ([user:Um_nik,2021-10-22]) — a 7* coder on CodeChef with a peak rating of 3567 on Codeforces. He is the ICPC 2020 World Champion, and also the head CodeChef admin. - **Jay Leeds** ([user:Geothermal,2021-10-22]) — a 7* coder on CodeChef with a peak rating of a 2927 on Codeforces. He was a bronze medalist in the ICPC 2020 Invitational Contest, and also the Facebook HackerCup Finalist in 2020. **Lockout Details:** - Link: https://www.youtube...
CodeChef Lockout #5 — Um_nik vs Geothermal

Read more »

 
 
 
 
  • Vote: I like it
  • +167
  • Vote: I do not like it

 
 
 
 
9.
By Geothermal, history, 20 months ago, In English
Codeforces Round 629 -- Unofficial Solutions Hi all! As it might be a little while before the editorial for today's round is released (due to the open hacking phase), I thought I'd publish my solutions in case anyone wants to review the problems right away. --- #A — Divisibility Problem There are a few ways to approach this. One is to find the next multiple of $B$ after $A$ and subtract $A$. Recall that we can compute $\frac{A}{B}$, rounded up, as $\frac{A+B-1}{B}$, rounded down. We can compute this value and then multiply it by $B$ to get the next multiple of $B$, subtracting $A$ to get our answer. An alternative solution (and the one I implemented) is to realize that, as long as $A$ isn't already a multiple of $B$, the number of moves required is $B - (A \% B)$, since the distance to the next lower multiple of $B$ plus the distance to the next higher multiple of $B$ will be $B$. We can use this to compute the answer. In the case where $A$ is a multiple of $B$, this prints $B$ instead of $0$, so we can ...
Geothermal

Read more »

 
 
 
 
  • Vote: I like it
  • +97
  • Vote: I do not like it