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.
By MikeMirzayanov, 7 days ago, In English
Codeforces Round 1134 (Div. 4) Hello Codeforces! I am glad to invite you to [contest:2290], which will take place on [contest_time:2290]. After quite a long break, I have taken up problem setting again — this time working together with AI agents. For me, this is an experiment in getting back into problem writing, and we will see together how successful AI turns out to be as a partner in this work. I am looking forward to seeing both Div. 4 participants competing officially and everyone else joining out of competition! <div style="height:1em;"></div> <spoiler summary="Why I decided to author this round (a bit of lyrics and rambling)"> Yes, I am dictating these words into my phone right now, to put them into shape for you a bit later. We live in an amazing time when so many things are changing. I have been programming for more than 25 years now, and throughout almost all of this time I wrote code every day and solved problems every day. At first, these were mostly programming contest problems — ...
Codeforces Round 1134 (Div. 4)

Full text and comments »

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

2.
By -Morass-, history, 9 years ago, In English
Problem Topics Good Day to you! I've been asked to make some topic-wise list of problems I've solved. Even though I couldn't involve all problems, I've tried to involve at least "few" problems at each topic I thought up (I'm sorry if I forgot about something "easy"). I've alredy made such list once anyway I've tried to include more problems now &mdash; so here it is: <spoiler summary="aho"> http://www.spoj.com/problems/ADAJOBS/ URI 2226 (5) //[NICE][NUMBERS][DP] http://www.spoj.com/problems/SUB_PROB/en/ http://codeforces.me/contest/696/problem/D 8 http://www.spoj.com/problems/AHOCUR/ 5 //Aho-Corassic + DP https://www.codechef.com/problems/LYRC (5) //Sample aho-brute-force http://codeforces.me/problemset/problem/346/B //Proposed by [user:bradyawn,2019-08-03] </spoiler> <spoiler summary="automat"> 6861 [LA] //CYK UVA 10679 //Suffix Automat http://www.spoj.com/problems/STRMATCH/ //Suffix Automat &mdash; trie might do too http://www.spoj.com/problems/NSUBST...
LightOJ 1134

Full text and comments »

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

3.
By JuicyGrape, 3 years ago, In English
CSES Additional problems tutorial Many thanks to [user:miaowtin,2023-10-01] and [user:FBI,2023-10-01] for their invaluable help and support in the preperation of this blog. Unfortunately, this blog is not currently completed, but we encourage everybody to share their solutions to these and other problems of the section in comments. And last but not least thanks to [user:pllk,2023-10-01] for maintaining CSES. [Shortest Subsequence](https://cses.fi/problemset/task/1087/) <spoiler summary="Prerequisites"> Greedy </spoiler> <spoiler summary="Tutorial"> Consider the string $s=s_1,\dots,s_n$. Suppose $s_i$ is the first occurence of a letter $c$ (the string looks $s_1,\dots,s_i,\dots,s_n$). If we output $c$, the problem reduces to $s=s_{i+1},\dots,s_n$. The number of such outputs must be minimalized. Observation: the largest $i$ we choose, the smallest string we obtain. Greedy solution is always to take the largest $i$ such that $s_i$ is the first occurence. But after this traversal, the string we output is ...
[Prüfer Code](https://cses.fi/problemset/task/1134)

Full text and comments »

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

4.
By syrtin, history, 3 years ago, In English
CSES sorted by number of solves 98870 https://cses.fi/problemset/task/1068 84128 https://cses.fi/problemset/task/1083 73464 https://cses.fi/problemset/task/1069 68570 https://cses.fi/problemset/task/1094 60297 https://cses.fi/problemset/task/1070 46283 https://cses.fi/problemset/task/1621 45685 https://cses.fi/problemset/task/1633 42682 https://cses.fi/problemset/task/1071 40314 https://cses.fi/problemset/task/1617 39319 https://cses.fi/problemset/task/1634 37742 https://cses.fi/problemset/task/1618 36164 https://cses.fi/problemset/task/1635 34591 https://cses.fi/problemset/task/1092 33748 https://cses.fi/problemset/task/1084 33562 https://cses.fi/problemset/task/1637 33225 https://cses.fi/problemset/task/1754 32099 https://cses.fi/problemset/task/1090 32004 https://cses.fi/problemset/task/1072 31920 https://cses.fi/problemset/task/1638 31209 https://cses.fi/problemset/task/1192 30358 https://cses.fi/problemset/task/1636 30329 https://cses.fi/problemset/t...
875 https://cses.fi/problemset/task/1134

Full text and comments »

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

5.
By MikeMirzayanov, 4 days ago, In English
Codeforces Round 1134 (Div. 4) Editorial Hello, Codeforces! Thank you all for participating in [contest:2290]! I hope you enjoyed the problems and had a good time. Special thanks to everyone who helped prepare and test the round! Below you will find tutorials for all the problems. If anything is unclear, feel free to ask questions in the comments. I would love to read about your solutions too! [problem:2290A] <spoiler summary="Tutorial"> [tutorial:2290A] </spoiler> [problem:2290B] <spoiler summary="Tutorial"> [tutorial:2290B] </spoiler> [problem:2290C] <spoiler summary="Tutorial"> [tutorial:2290C] </spoiler> [problem:2290D] <spoiler summary="Tutorial"> [tutorial:2290D] </spoiler> [problem:2290E] <spoiler summary="Tutorial"> [tutorial:2290E] </spoiler> [problem:2290F] <spoiler summary="Tutorial"> [tutorial:2290F] </spoiler> [problem:2290G1] <spoiler summary="Tutorial"> [tutorial:2290G1] </spoiler> [problem:2290G2] <spoiler summary="Tutorial"> [tutorial:2290G2...
Codeforces Round 1134 (Div. 4) Editorial, Разбор задач Codeforces Round 1134 (Div. 4)

Full text and comments »

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

6.
By kostka, 12 years ago, In English
Hack me! (CF Round #263, Div. 2) Welcome again! I decided to split statistics for both division. Post for first division <strike>will be added later</strike> is <a href="http://codeforces.me/blog/entry/13572">here</a>. So, let's look at hacks in [contest:462]. <small><strike>Some statistics are missing &mdash; I have some problems with downloading all data (Codeforces seems little crowded today). They will be also added later.</strike></small> **Update**: Europe went asleep, so I added missing stats. [cut] <h3>Stats</h3> Problem | Successful hacks | Unsuccessful hacks | Other | Sum | :---:|:---:|:---:|:---:|:---:| [problem:462A] | 5 (17%) | 25 (83%) | 0 (0%) | 30 | [problem:462B] | 1193 (71%) | 188 (11%) | 306 (18%) | 1687 | [problem:462C] | 0 (0%) | 55 (36%) | 98 (64%) | 153 | ### Fastest hackers Problem | Time | Hacker | Defender | Hack :---:|:---:|:---:|:---:|:---:| [problem:462A] | 00:50:08 | [user:ak.bewildered,2014-08-26] | [user:abdohammam95,2014-08-26] | <a href="http://codefo...
/110945/">110945|[user:Zoli,2014-08-26] [1134] | [user:thfrollo,2014-08-26] [1598], /contest/462/hacks/110945/">110945|[user:Zoli,2014-08-26] [1134] | [user:thfrollo,2014-08-26] [1598

Full text and comments »

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

7.
By pani.natalia, 6 years ago, In English
How to become red. 01. Can a gray one become red? The most popular question on Codeforces must be "How to become red". I've just (February 2021) ran a script and discovered that the current number of Codeforces profiles is 323553. Only 1622 profiles have in their history a rating more than 2400. [cut] I should say, not as many reds as I expected. [My script on github.](https://github.com/NataIss/codeforces) I hope you remember that a newcomer used to start with 1500 points. I selected users who fell down to the grey level but did not give up and later became red. Let me introduce these 40 brave guys: - [user:Aleks5d,2021-02-19] min 1195 max 2683 - [user:Ali.Kh,2021-02-19] min 1167 max 2600 - [user:Alpha_Q,2021-02-19] min 999 max 2452 - [user:Arpa,2021-02-19] min 1057 max 2679 - [user:Arthur,2021-02-19] min 1158 max 2592 - [user:Atreus,2021-02-19] min 1134 max 2729 - [user:Bench0310,2021-02-19] min 1158 max 2502 - [user:CTPAX,2021-02-19] min 1188 max 2416 - [user:Danylo99,2021-02-19] min 1195...
1158 max 2592 - [user:Atreus,2021-02-19] min 1134 max 2729 - [user:Bench0310,2021-02-19] min, -02-19] min 1134 max 2729 - [user:Bench0310,2021-02-19] min 1158 max 2502 - [user:CTPAX,2021

Full text and comments »

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

8.
By Gwyn_Bleidd, history, 3 days ago, In English
Request for Manual Review of Disabled Account — Manam_the_Wildfire **# Request for Manual Review of Disabled Codeforces Account — Manam_the_Wildfire** Hello Codeforces Administration and @MikeMirzayanov, I am writing through a friend's Codeforces account, with their permission, because my original account, *@Manam_the_Wildfire*, has been disabled. When I try to access my account or log in, it displays the message, "The user is disabled". I have not received any email or notification explaining the reason for this restriction. I would sincerely appreciate a manual review of my account and my participation in *Codeforces Round 1134 (Div. 4)*. ## What happened during the contest During the contest, I experienced electricity and internet connectivity problems. As a result, I could not participate through the normal online process. A friend who was not participating in the contest sent me copies of the problem statements. I independently solved the problems on my own computer without receiving solutions, algorithms, hints, or code ...
Round 1134 (Div. 4)*., appreciate a manual review of my account and my participation in *Codeforces Round1134 (Div. 4, - Codeforces handle: @Manam_the_Wildfire - Contest: Codeforces Round 1134 (Div. 4) - Contest, 1. A manual review of my account and all six submissions from Round 1134. 2. Clarification

Full text and comments »

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

9.
By Rishabh.Jain, history, 6 years ago, In English
One gets accepted other don't, even-though they seem similar. [Problem: Cards](https://acm.timus.ru/problem.aspx?space=1&num=1134) This code got accepted ~~~~~ #include <bits/stdc++.h> using namespace std; typedef long long int lli; #define int lli int n; int m; vector<int> arr; vector<int> inp; void can(int pos){ if(pos == m){ cout<<"YES"<<endl; exit(0); } int cur = inp[pos]; assert(cur>=0); if(arr[cur]<=0){ return; } arr[cur]--; if(cur == 0){ if(arr[cur+1]>0){ arr[cur+1]--; can(pos+1); arr[cur+1]++; } }else{ if(arr[cur-1]>0){ arr[cur-1]--; can(pos+1); arr[cur-1]++; } if(arr[cur+1]>0){ arr[cur+1]--; can(pos+1); arr[cur+1]++; } } } void solve(){ cin>>n>>m; arr.resize(n+4); inp.resize(m); for(int i=1;i<=n;i++){ arr[i-1]++; arr[i]++; } for(int i=0;i<m;i++){ cin>>inp[i]; } sort(inp.begin(), inp.end()); can(0); cout<<"NO"<<endl; } si...
[Problem: Cards](https://acm.timus.ru/problem.aspx?space=1&num=1134)

Full text and comments »

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

10.
By EZDUBS, history, 3 years ago, In English
Greedy Algorithm not working Consider this problem: https://www.acwing.com/problem/content/description/129/ Translation: A company has M tasks to be completed. Each task has a corresponding difficulty level and the time required to complete the task. The difficulty level of tasks is $y_i$. The time required to complete the task is $x_i$. If the company completes this task, they will receive $500 x_i+2 y_i$ income. The company has N machines, each with a maximum working time and maximum difficulty level. If the task requires more time than the maximum working time of the machine, the machine cannot complete the task. If the difficulty level of the task exceeds the maximum difficulty level of the machine, the machine cannot complete the next task. Each machine can only complete one task in a day. Each task can only be completed by one machine. Find the maximum number of tasks that can be completed, and the corresponding profit. If there are multiple solutions, choose the one that earns the highest profit...
1334 91 120 42 514 36 756 4 1027 53 293 82 166 16 1025 95 1134 26 392 38 432 12 1222 99, 16 1025 95 1134 26 392 38 432 12 1222 99 1218 94 1363 11 1104 33 406 64 752 11 913 68

Full text and comments »

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

11.
By Not_Abdul_Munim, 3 days ago, In English
Can somebody explain please ? In the last round [Codeforces Round 1134 (Div. 4)](https://codeforces.me/contest/2290) this [submission](https://codeforces.me/contest/2290/submission/398300564) got accepted for the problem E &mdash; Avalanche although after looking at the constraints we can clearly see that the code will face an integer overflow so, is it due to weak testcases or something else ? because mostly when I get an integer overflow I get a diagnostic warning if it is normal can any one tell for which integer overflows our code will run normal and for which it will not and also there is also a submission I was seeing code of this person [code](https://codeforces.me/contest/2290/submission/398441403) he has similar logic but he is having a wrong answer due to the integer overflow so my question is that did the code above passed by luck or is there something else behind the scenes! Any insights would be appreciated! ![ ](/predownloaded/37/1d/371d87815392a9684282bedb040b74a331682c3e.png)
In the last round [Codeforces Round 1134 (Div. 4)](https://codeforces.me/contest/2290)

Full text and comments »

12.
By Laggy, 9 years ago, In English
Codeforces Progress Statistics As a desperate Pupil I was interested in knowing some more about grand masters and decided to look if any once-newbies besides [user:zscoder,2018-03-25] have made it to red. ### Insanely Dedicated People <table> <tr> <th>User</th> <th>Minimum Rating</th> <th>Maximum Rating</th> <th>Δ</th> </tr> <tr><td>[user:zscoder,2018-03-25]</td> <td>1117</td> <td>2908</td> <td>+1791</td></tr> <tr><td>[user:netman,2018-03-25]</td> <td>1105</td> <td>2625</td> <td>+1520</td></tr> <tr><td>[user:Arthur,2018-03-25]</td> <td>1158</td> <td>2592</td> <td>+1434</td></tr> <tr><td>[user:Shayan,2018-03-25]</td> <td>1119</td> <td>2498</td> <td>+1379</td></tr> <tr><td>[user:duyboy135,2018-03-25]</td> <td>1098</td> <td>2467</td> <td>+1369</td></tr> <tr><td>[user:sillycross,2018-03-25]</td> <td>1182</td> <td>2540</td> <td>+1358</td></tr> <tr><td>[user:senek_k,2018-03-25]</td> <td>1084</td> <td>2430</td> <td>+1346</td></tr> <tr><td>[user:SmallBoy,2018-03-25]</td> <td>1165</td...
1134 [user:PrashantM,2018-03-25] 1182 2314 , >[user:my_new_handle,2018-03-25] 826 1960 1134

Full text and comments »

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

13.
By ninad-naik, history, 29 hours ago, In English
Request for Manual Review of Disabled Codeforces Account — Nikhil_. Hello Codeforces Administration and @MikeMirzayanov, I am writing from my friend's Codeforces account, @ninad-naik, with the account owner's permission, to request a review of my disabled account. My original Codeforces handle is @Nikhil\_. I want to be completely honest about what happened. During Codeforces Round 1134 (Div. 4), I used ChatGPT to generate a solution for one problem and submitted the AI-generated code during the live contest. I would also like to clarify that this was the first and only time I used AI to obtain a solution during a Codeforces contest, and it was limited to just one problem. I now understand that using AI-generated solutions during a live contest violated Codeforces rules. I sincerely apologize and take full responsibility for my actions. I deeply regret this mistake. I understand the importance of fair competition and respect the Codeforces rules. Whenever I try to access my original account, I receive the following message: "Use...
happened. During Codeforces Round 1134 (Div. 4), I used ChatGPT to generate a solution for one problem and, Contest: Codeforces Round 1134 (Div. 4), I want to be completely honest about what happened. During Codeforces Round 1134 (Div. 4), I used

Full text and comments »

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

14.
By thechamp95821, history, 3 years ago, In English
DIFFICULTY IN SOLVING 1200 RATED PROBLEMS Hi everyone, so recently I have been solving some 1200 rated problems from the problemset..and am facing difficulty in solving many of those problems. However , I am comfortable with the problems that have relatively straightforward approaches.. like the mathematical ones and some problems involving strings. But I am not able to solve the problems with out of the box approaches like in the problems [Paranoid String](https://codeforces.me/problemset/problem/1694/B) and [Madoka and the elegant String](https://codeforces.me/problemset/problem/1647/B). This has been causing me trouble in the contests as now-a-days, I am having a hard time solving Problem B but can solve Problem C relatively easily (which I think is pretty wierd lol) and due to this my contest rating has dropped from 1261 to 1134 (in my alt. account) as I spend way too much time on the B problem. It is sometimes quite demotivating :(( 1)So , for these type of questions, should I spent more time on these problems (2-...
my contest rating has dropped from 1261 to 1134 (in my alt. account) as I spend way too much time, to 1134 (in my alt. account) as I spend way too much time on the B problem. It is sometimes quite

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

15.
By harishsanaka, history, 6 years ago, In English
why my rating is falling very rapidly...!?? I first participated in round #604 solved 0 problem, then my rating was 1371 second #611 solved 1 problem, then my rating became 1248 third #649 solved 0 problem, then my rating became 1134 fourth #650 solved 1 problem, then my rating became 1036 even I solved atleast 1 problem in my fourth contest why my rating falled drastically..?
solved 0 problem, then my rating became 1134 fourth #650 solved 1 problem, then

Full text and comments »

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

16.
By hzhihihi, history, 4 days ago, In English
Appeal regarding banned in Rounds 1134 – Handle: tranquynhchi147 Dear : @MikeMirzayanov Sorry but,I was not great in English I was doing div4 in @tranquynhchi147 and I was offline code 2 task / a time so i submitted 2 task between one minute By the way i wasn't use AI while contest and im willing to proof my solution for all problem i've did and some of my cert to prove that i have enough ability to do that much task in that sort time , so , please @MikeMirzayanov can check my submission again and consider to unban my account Thank you @MikeMirzayanov [user:MikeMirzayanov,2026-11-12]
Appeal regarding banned in Rounds 1134 – Handle: tranquynhchi147

Full text and comments »

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

17.
By kocogica, history, 22 hours ago, In English
I don't know what's happening to me. I have participated in Codeforces Round 1134(Div. 4). I'm sure that in contest, I don't contact to any participants in that contest. My solution for problem H is coincides with Valraud accidently. What I need to do to next -(?
I have participated in Codeforces Round 1134(Div. 4). I'm sure that in contest, I don't contact to

Full text and comments »

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