| # | User | Rating |
|---|---|---|
| 1 | orzdevinwang | 3828 |
| 2 | tourist | 3796 |
| 3 | jiangly | 3710 |
| 4 | jqdai0815 | 3682 |
| 5 | Ormlis | 3641 |
| 6 | ecnerwala | 3627 |
| 7 | Benq | 3539 |
| 8 | Kevin114514 | 3476 |
| 9 | Radewoosh | 3463 |
| 10 | heuristica | 3431 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 161 |
| 3 | Qingyu | 159 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 154 |
| 5 | adamant | 154 |
| 7 | djm03178 | 151 |
| 7 | luogu_official | 151 |
| 9 | errorgorn | 149 |
| 10 | awoo | 148 |
Greetings Codeforces!
First things first, we would like to thank everyone who participated in the previous eleven Kotlin Heroes competitions:Episode 1,Episode 2,Episode 3,Episode 4,Episode 5: ICPC Round,Episode 6,Episode 7,Episode 8,Episode 9,Episode 10 andEpisode 11.
Kotlin Heroes is a great way to play around with Kotlin’s features, learn something new, and practice using the language by solving fun problems. It is great for programmers of any level!
We invite you tojoin thepractice round, where you can improve your algorithmic problem-solving skills and complete training problems. In this round, all the solutions are open and you can request hints if you’re stuck.
Here are some things you can do to help you refresh your knowledge of Kotlin and learn more about competitive programming while you practice:
- Review our Kotlin solutions for theAdvent of Code algorithmic puzzles.
- Read ourcompetitive programming tutorial.
- Watch the videos from ourKotlin in Competitive Programming YouTube playlist.
- Look at the problems from theprevious practice rounds.
OnApril 7, 2025, the real challenge begins!Kotlin Heroes: Episode 12 will last2 hours 30 minutes and will feature a range of problems – from simple tasks anyone can solve to tricky challenges for seasoned competitive programmers.
The contest will containat least one interactive problem, so we strongly recommend that you familiarize yourself with them — for example, by solving problem F from the practice round and/or reading theCodeforces guide for interactive problems. The flush operation in Kotlin is done by callingSystem.out.flush().
The use of AI-based tools during the main contest is strictly limited. To find out the guidelines for proper AI use, what is allowed and what is prohibited, please read the post "Rule Restricting the use of AI". Improper use of AI tools during the main contestmay result in disqualification.
Prizes:
The top three winners will receive cash prizes of $512, $256, and $128 (or rewards of equivalent value), respectively. The top 50 participants will win a Kotlin Heroes T-shirt and an exclusive Kotlin sticker, and all competitors who solve at least one problem will be entered into a raffle for one of 50 Kotlin Heroes T-shirts.
Please note that we are not able to ship prizes to any country, state, province, or territory subject to comprehensive OFAC sanctions, including Belarus, Cuba, Iran, North Korea, Russia, Syria, or the Crimea, Donetsk, or Luhansk regions. For complete the list, please visitthis page.
Best of luck to everyone!
Announcement ofKotlin Heroes: Episode 12Announcement ofKotlin Heroes: Practice 12
Hi, Codeforces!
We are pleased to invite you toTeza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2), which will be held onApr/05/2025 17:35 (Moscow time)
The problems are authored and prepared byCharlieV and me. You will be given8 problems, one of which is divided into two subtasks, and3 hours to solve them.The round will be rated for everyone.
I would like to thank everyone who has helped prepare for this round:
- Sugar_fan for his excellent coordination.
- Alexdat2000 for the Russian translation.
- CharlieV,ExplodingKonjac,QwQwf,sinsop90 for providing problem ideas despite a few unused.
- 244mhq for reviewing some of the problems when coordinating my previous rounds.
- jqdai0815,StarSilk,244mhq,N_z__,yeminghan,Error_Yuan,dieselhuang,YuJiahe,QwQwf,Hanghang007,Retired_shstyle,gdf_yhm,66E61d,hashman,Kita_Ikuyo for testing the round and providing useful feedback.
- MikeMirzayanov for Codeforces and Polygon.
The score distribution is $$$750 - 1000 - 1500 - 1750 - 2250 - 3000 - (2500 - 1750) - 3750$$$.
Good luck, have fun!
And now, a few words from today's sponsor!
Greetings, Codeforces Talents!
We are thrilled to invite you toTeza’s first Codeforces competition!
Participants will have a chance to winTeza sticker packs and T-shirts:
- Thetop 25 ranked competitors.
- 25 randomly selected from places 26-100.
As a systematic quantitative hedge fund, we know that exceptional talent drives success—so seeing this community come together is truly exciting.
Good luck to all participants! And for those not competing, thank you for stopping by—if you're passionate about technical and algorithmic challenges, solving Olympiad-style problems, and diving into data-driven research, we’d love to connect.
Check out our career opportunitieshere and explore where your skills can take you. To join our team, pleasefill out the form.
Enjoy the competition and happy coding!
UPD 1: Score distribution changed.
UPD 2:Editorial is released.
UPD 3: Congratulations to the winners!
- orzdevinwang (Congratulations on solving all problems!)
- Ormlis
- ecnerwala
- Benq
- maroonrk
- LJC00118
- Kevin114514
- tourist
- 0tesmem
- jiangly
Announcement ofTeza Round 1 (Codeforces Round 1015, Div. 1 + Div. 2)
We’re excited to launch the first-ever Midnight Code Cup (MCC) — a team competition featuring an online Qualification round and a 24-hour onsite Final. Expect algorithmic challenges, optimization puzzles, cutting-edge computer science, and some just plain weird problems. It’ll be exhausting. And fun.
Who are we?
A team of problem solvinggeeksveterans enthusiasts, eager for the return of this contest format. The idea of Midnight Code Cup was born atRecraft.AI (AI image generation and graphic design pioneers) with huge support fromJetBrains (creator of Kotlin, intelligent IDEs, and AI-driven developer tools) as well asNeon (developer-first open-source database) andPinely (HFT company powered by competitive programmers).The sponsor list is not final and will be updated.
We are also thankful to have Codeforces as our hosting partner.
Who can participate?
Teams of 3 ready to rock and roll! No programming language, affiliation or problem solving methods restrictions. You only need to be at least 18 years old and have a slightly concerning enthusiasm for coding challenges.
Save the Date
April 12, 2025: Online Qualification (4 hours) – here at Codeforces, starts at 13:00 UTC
June 7–8, 2025: Onsite Final (24 hours) – Belgrade, Serbia
Problem setters and jury:Aksenov239,isaf27,NALP,Taube,Gassa,cdkrot,PavelKunyavskiy,tourist,qwerty787788,MaxBuzz,pvs,Solenoid555,nsychev,naagi
Registration opens soon – you have enough time to find a team. Leave your emailhere and you will be the first to register.
See you at Midnight!
Update: We've set the start time for the qualification round (13:00 UTC). The duration has been changed to 4 hours to accommodate participants across multiple time zones, although covering all regions globally remains a challenge.
Update 2: The registration is open now:https://midnightcodecup.com
Update 3: The registration will close on April, 9th
Hello Codeforces!
The series of Educational Rounds continues thanks to the support of theNeapolis University Pafos.
OnApr/03/2025 17:35 (Moscow time)Educational Codeforces Round 177 (Rated for Div. 2) will start.
This round will berated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.
You will be given6 problems and2 hours to solve them.
The round is based on the problems from the Open Championship of Karelia in competitive programming.
The problems were invented and prepared by GalinaGalina_Basalova Basalova, ValentinValentin_E Ermishin, Levrobotolev Provotorin and me.
I would like to thank the authors of the championship problems whose tasks were not included in the final set for the round: Ruslanr314 Alkin, Yuriybasalov_yurij Basalov, Alexeyashmelev Shmelev, and NikolayNicola95 Ermolin.
I would also like to express my sincere thanks to the round coordinators: IvanBledDest Androsov and Mikhailawoo Piklyaev for improving the quality of the problems and helping with their preparation.
Big thanks to our testers:Brovko,deni1000,KIRIJIJI,shnirelman,Alenochka,slash0t,LightSky,infinite_meltdown,Knh_era,M1chail,Antithesis,Kolychestiy,neohacker for their valuable advice and suggestions!
And of course, huge thanks to MikeMikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.
Good luck to all the participants!
Our friends at Neapolis University Pafos also have a message for you:
Admission to theComputer Science and Artificial Intelligence bachelor's program at Neapolis University Pafos is open!
TheJetBrains Foundation supports this bachelor's program and offers20 fully funded scholarships for talented first-year students. They initially announced 15 scholarships but have now increased the number to 20 to give more students the opportunity to join the program.
Each scholarship coversentire duration of the program, includingtuition, accomodation, medical insurance, visa fees, and €300/month pocket money.
They are also offering now2 fully funded scholarships for students transferring into the second year of the program.
First admission round:
- Application deadline – April 23, 2025
- Entrance test – April 27, 2025
UPD:Editorial is out
Announcement ofEducational Codeforces Round 177 (Rated for Div. 2)Hello, Codefoolers!
We,AlperenT,flamestorm,prvocislo,temporary1,ToxicPie9, and-1e11, would like to invite everyone on Codeforces toApril Fools Day Contest 2025! The 13th April Fools Day Contest will take place onApr/01/2025 17:35 (Moscow time). This is a joke competition in which solving the problem is often easier than figuring out what the actual task is.
In this round, you will be given $$$n$$$ problems where $$$\sum\limits_{x=1}^{\infty} \frac{1}{x^n}$$$ converges and2 hours to solve them. The contest will use extended ICPC rules (no hacks, the standings are decided by the number of solved problems and penalty time earned on them). You can submit solutions in any language allowed by Codeforces, unless the problem says otherwise.
Please note that the round isunrated and that the penalty for awrong submission is10 minutes.
To get an idea of what the contest will look like, you can check out the contests of the past years:2012,2013,2014,2016,2017,2018,2019,2020,2021,2022,2023,2024
Thanks to our precious testers (they exist, trust me):
Please do not bother sending clarification requests in the contest as we obviously do not enjoy sending funny responses like we did in the last two years. It is definitely not the most fun part of April Fools.
Lastly, we have avideo editorial this year (Russian captions available)!
Good luck, andhave fun!
Edit 1:Editorial is out!
Edit 2:
Congratulations to the winners:
And the first solves on each problem:
- A:vladimirfilip
- B:Auchenai01
- C:Dark (afterAprilFoolsClairvoyant)
- D:koishi.komeiji
- E:jiangly
- F:tiom4eg
- G:BucketPotato
- H: N/A (butcircle977 got closest with every word except 10th)
- I:SeptaCube
- J:fishy15 (initiallyconqueror_of_tourist, but got hacked after the contest)
Announcement ofApril Fools Day Contest 2025
Xin Chào, Codeforces! (☆^ー^☆)
We are thrilled to invite you to participate inCodeforces Round 1014 (Div. 2), which will be held onMar/29/2025 17:35 (Moscow time).
This round will berated for all participants with rating below 2100. Participants with higher ratings are encouraged to participate out of the competition.
You will be offered6 problems and 2 hours to solve them. The tasks were authored and written byk1sara andsergeev.PRO. We hope you enjoy the challenge!
A heartfelt thank you to everyone who made this round a reality:
244mhq andUm_nik for expertly coordinating the contest and offering invaluable guidance throughout the process,
makrav,zltzlt,IzhitskiyTimofey,sadness,Noinoiio,max0000561,Vash_nick,yunetive29,ahmetalp,DimonKrutoi,dope,Fu2o,Mikhango,re-wa-tl-ok,VictorKleymenov for testing our round and providing impactful feedback,
danya111 for coming up with some exceptionally riveting excuses as to why he’s too busy to test our round,
sergeev.PRO for being an amazing co-author, for putting up with my endless complaints, and for generously letting me copy every math homework over the past five years,
MikeMirzayanov for the fantastic Codeforces and Polygon platforms.
You for participating in the round.
[UPD 1] The score distribution (now changed) will be as follows:
[UPD 2]EDITORIAL
[UPD 3] Congratulations to the winners!
All participants:
Rated only:
Announcement ofCodeforces Round 1014 (Div. 2)Greetings, Codeforces Talents!
We are thrilled to invite you toTeza’s first Codeforces competition!
Teza, founded in 2009 as a high-frequency trading firm, has evolved into a leading systematic quantitative hedge fund. From equities to options, futures, and crypto, we transform complex mathematical concepts into financial strategies that operate across the world's largest markets.
Our team is composed of some of the brightest minds in the industry, including International Olympiad winners in Physics and Mathematics, and the youngest individuals ever to earn double Ph.D.s in Computer Science and Physics from MIT. Our CEO, Misha Malyshev, a MIPT graduate with a Ph.D. from Princeton, is known for setting an unbeaten world record for returns on capital on Wall Street.Learn more about Misha.
We have a team member who has discovered a new star, highlighting our commitment to pioneering exploration in all fields. We believe that only exceptional minds make markets efficient.
Good luck to all participants! And for those not competing, thank you for stopping by — if you're passionate about technical and algorithmic challenges, solving Olympiad-style problems as your day-to-day job, we’d love to connect.
Check out our career opportunities here and explore where your skills can take you.
Enjoy the competition and happy coding!
Hello, Codeforces \[^-^]/
The competitive programming laboratory of theIT campus NEIMARK from Nizhny Novgorod is pleased to invite everyone to participate inCodeforces Round 1013 (Div. 3), which will be held onMar/25/2025 17:35 (Moscow time).
The round is based on the problems of the final of the first olympiad by IT campus NEIMARK. 312 students from 28 subjects of the Russian Federation took part in the olympiad. And at the final competition, in addition to Nizhny Novgorod students, we met finalists from the Chuvash Republic, Moscow, Tolyatti, Kirov, Saransk and Ulyanovsk.
If you participated in the final of this olympiad, please refuse to officially participate in this round.
The topics of the tasks will be related to the working daysand weekends of our laboratory. The laboratory has existed for a little less than a year, but during this time several training camps, many personal and team trainings have been held, and dozens of tasks for school and student competitions have been developed (you can find some of these competitions in the sectionGym). We opened competitive programming clubs in schools in Nizhny Novgorod, and began training interested IT teachers. We also acted as a venue for several programming competitions.
And atMar/25/2025 17:35 (Moscow time) we will finally share with you one of the most important results of our work.
You will be given7 problems and2 hours and 15 minutes to solve them.
Note that thepenalty for the wrong submission in this round is10 minutes.
The round will be hosted by rules of educational rounds (extended ICPC). Thus, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase ofopen hacks. After open hacks all accepted solutions will be rejudged on successful hacks.
Remind yourself that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participant of the third division, you must:
- take part in at least five rated rounds (and solve at least one problem in each of them).
- not have a rating of 1900 or higher at any moment in time.
Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you (unless you register unrated).
We hope you will enjoy problems! The tasks were prepared by our laboratory staff: Alexeyashmelev Shmelev, Islaml-_-l Shayakhmetov and DianaDiall_ Alyaseva.
Thanks toMikeMirzayanov for the CodeForces and Polygon systems. Thanks toVladosiya for the coordination and help in preparing the round.
Thanks to our testers:MForest,OG_Matveychick1,Tmitmi,Riladavin,quaha,eepsilon,SL0NYARA,konred,NerfThis,gtheoden42,sasha00123,doreshkin,blinowartemcka,--S,bugrova,Itsmylove1
Good luck for everyone and praise the sun \[^-^]/
Upd.Editorial
Announcement ofCodeforces Round 1013 (Div. 3)
| Name |
|---|