Rockethon 2015 Announcement <a href="http://rocketfuel.com/"><img src="http://assets.codeforces.com/images/rockethon/HZ-LOGO-TAG-RGB-big.png" style="float:right;margin:0 2em 2em 2em;"/></a> Hello Codeforces community, I am happy to announce that [Rocket Fuel Inc.](http://rocketfuel.com/) will be hosting a Rockethon competition again! The contest is prepared by Rocket Fuel employees Eldar Bogdanov, Anton Lomonos, Lasha Lakirbaia, Alexander Ruff, Nikhil Goyal and me, Ievgen Soboliev. We hope everyone will find some interesting problems in the contest and everyone will have as much fun solving these problems as we had preparing them. Just like last year, the best participants will receive valuable prizes and top performers will get Rockethon 2015 T-shirts! Also, Rocket Fuel is interested in hiring people after this event, so please fill out the simple form during registration. About Rocket Fuel --------------------- Rocket Fuel is building technology platform to do automatic targeting and optimization of a...

Full text and comments »

Teams going to ACM ICPC World Finals 2018 I think it's good time for collecting teams that are going to WF this year. Let's complete the table together :) Europe ====== | Count | Country | Region | University | Member 1 | Member 2 | Member 3 | | ----- | ------- | ------ | ---------- | -------- | -------- | -------- | | 1 | Belarus | NEERC | Belarusian State University | [user:progmatic,2018-04-12] | [user:Fedosik,2018-04-12] | [user:vilcheuski,2018-04-12] | | 2 | Estonia | NEERC | University of Tartu | [user:oml1111,2018-04-12] | [user:hoomas,2018-04-12] | [user:k__mas,2018-04-12] | | 3 | Kazakhstan | NEERC | Kazakh-British Technical University | [user:Zharaskhan,2018-04-12] | [user:AeonHQ,2018-04-12] | [user:NurlashKO,2018-04-12] | | 4 | Russia | NEERC | Moscow Aviation Institute | [user:mingaleg,2018-04-12] | [user:SirRembocodina,2018-04-12] | [user:i.trofimow,2018-04-12] | | 5 | Russia | NEERC | Moscow Institute of Physics & Technology | [user:Golovanov399,2018-04-12] | [user:Kostroma,2018-04-12] | [user:I_hate_A...

Full text and comments »

Stanford Local Programming Contest 2026 **Edit: Registration deadline extended by 12 hours -- to 9PM pacific time today!** Hello Codeforces! We ([user:ritwin,2026-03-26], [user:nikilrselvam,2026-03-26], [user:spycoderyt,2026-03-26], [user:lethan3,2026-03-26], [user:Mokuroh54,2026-03-26], [user:andy0liang,2026-03-26], [user:applepi216,2026-03-26], [user:bitset,2026-03-26], [user:minifinity,2026-03-26]) are excited to announce the **Stanford Local Programming Contest (SLPC 2026)** — a 3-hour ICPC-style team contest with **over $3,000 in prizes**! SLPC has historically been Stanford's internal contest and ICPC team tryout. This year, we're opening it up to the broader competitive programming community. - **Date:** Saturday, April 4, 2026 - **Local Division:** In-person at Gates 403, Stanford students only -- lunch and boba provided! - **Open Division:** Online, open to everyone - **Registration deadline:** April 2, 2026 at 8:59 PM PDT ## Links - [Website](https://cs.stanford.edu/group/acm/slpc/) - [Regist...

Full text and comments »

CF Sweatshirt signed by legends at ICPC World Finals Good morning! ICPC World Finals just concluded in Moscow. I was lucky enough to be participate representing the University of Central Florida, who finished in a respectable 17th place. While there, friends, acquaintances, and CF Legends signed my Codeforces sweatshirt in their handle with their current color. The most common request of the people I asked was to show off what it ended up looking like on a blog post of Codeforces, so here that is!   <spoiler summary="Famous Signings">   </spoiler> #### Signers: - [user:MikeMirzayanov,2021-10-11] the creator and maintainer of Codeforces and Polygon who deserves our eternal thanks, and [user:Una_Shem,2021-10-11] without whose work there would be no sweatshirt to sign. - [user:tourist,2021-1...

Full text and comments »

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 | | ----- | ------- | ------ | ---------- | -------- | -----...

Full text and comments »

[GYM] Stanford ProCo 2021 Hi Codeforces! This weekend we held the Stanford Programming Contest in an online format for USA High-Schoolers. Since it was online, the format allowed for teams of up to 3 members to use 3 total computers and the internet. We wanted to share the problems with you, so we added the contest to the gym [here](https://codeforces.me/gym/103091). (thanks [user:sqrtdecompton,2021-05-17] for graciously helping with that). Though it was a contest for high-schoolers, the problems should still be interesting for those below International Grandmaster. Try them out and let us know! Thanks to all of the other problem writers: [user:sherlockyholmes,2021-05-17], [user:radeye,2021-05-17], [user:swagchicken,2021-05-17], [user:csullivan203,2021-05-17], and [user:xiaowuc1,2021-05-17] And testers for excellent feedback: [user:miagkov,2021-05-17], [user:gigabuffoon,2021-05-17], [user:I_love_Harpae,2021-05-17], [user:MTSranger,2021-05-17], [user:alueft,2021-05-17], and [user:inutard,2021-05-1...

Full text and comments »

The 7th Turing Cup Tournament # 2025 · The 7th Turing Cup Tournament The Turing Cup is an invitational competition that is organized by one of the most successful informatics competition teams in China, the XinYouDui and partner with X-Camp Academy. ## Timeline | Event | Time (UTC+8) | |----------------------|-----------------------------------------| | Registration Time | May 06, 2025, 06:00 PM &mdash; May 25, 2025, 12:29 PM | | Opening Ceremony | May 25, 2025, 07:50 AM &mdash; 08:30 AM | | Contest Time | May 25, 2025, 08:30 AM &mdash; 12:30 PM | --- ## Contest Details ### Staff - Writers: [user:dXqwq,2025-05-22], [user:Flamire,2025-05-22], [user:myee,2025-05-22], [user:orzdevinwang,2025-05-22], [user:zhaohaikun,2025-05-22] - Testers: [user:dspt,2025-05-22], [user:emptyhope,2025-05-22], [user:jqdai0815,2025-05-22], [user:Kubic,2025-05-22], [user:le0n,2025-05-22], [user:zhaohiakun,2025-05-22] ### Features - **High Contest Q...

Full text and comments »

An awesome list for competitive programming! This is a project I started from late January 2016. My motive is that: Although there's fantastic information out there, I think they're still spread all over the place. Therefore, in my opinion it would probably be cool if there's an [awesome list](https://github.com/sindresorhus/awesome) for competitive programming! ( *It's now featured on the main list!* ) I'm actively updating the list here: [https://github.com/lnishan/awesome-competitive-programming](https://github.com/lnishan/awesome-competitive-programming) # Awesome Competitive Programming [](https://github.com/sindresorhus/awesome) A curated list of awesome `Competitive Programming`, `Algorithm` and `Data Structure` resources. Created with a view to connecting people to information, this list below contains a complete collection of all the fantastic resources I've collected over the course of my 11...

Full text and comments »

Teams Going to the 2025 ICPC North America Championship While we eagerly await the official announcement of which teams are competing in the 2025 ICPC North America Championship, there is some demand within NA to see who is competing! Please comment with your CF handles if your team will be attending! Note: As of the time of this post, not all divisional wildcards have been included (waiting for explicit confirmation from teams), nor global wildcards. [East Central North America](https://naeast24.kattis.com/contests/naeast24/standings?filter=6800) ========================== |University|Team Member 1|Team Member 2|Team Member 3| |------|--------------|-|-|-| |Carnegie Mellon University| [user:FizzyDavid,2024-12-16] | [user:Warriors_fsy,2024-12-16] | [user:cz_xuyixuan,2024-12-16] | |Purdue University| [user:canine,2024-12-16] | [user:golomb,2024-12-16] | [user:RobertYL,2024-12-16] | |University of Waterloo| [user:SirTechnical,2024-11-24] | [user:Mkswll,2024-11-24] | [user:kevinyang,2024-11-24] | |University of Toronto| | | | |Mi...

Full text and comments »

TeamsCode Summer 2022 Contest **Update: The problems are now uploaded on the gym! Thanks to everyone who participated on our contest! [https://codeforces.me/gym/103870](https://codeforces.me/gym/103870)** Hello Codeforces! [TeamsCode](https://www.teamscode.org/) is excited to announce the [TeamsCode Summer 2022 Virtual Programming Contest](https://www.teamscode.org/contests/summer-2022)! It will take place on [August 6th, 2022 at 9:45 AM PST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TeamsCode+Summer+2022+Programming+Contest&iso=20220806T0945&p1=224). **Teams of up to 4 members will have 3 hours to solve around 10 problems**. There are three divisions: Novice, Intermediate, and Advanced, so no matter what skill level you are, there is a place for you. Additionally, we will be featuring Dr. Peter Washington, who will be speaking about **Data Science for Digital Behavioral Phenotyping**. Dr. Peter Washington is an Assistant Professor in Information and Computer Sciences at the University ...

Full text and comments »

World Finals: Dress Rehearsal Live 13:59 &mdash; ~Petr,2013-07-02's [blog](http://petr-mitrichev.blogspot.ru/2013/07/acm-icpc-2013-world-finals-practice.html) for today 12:15 &mdash; That's it for Dress Rehearsal. Tune in tommorow. Bye-bye, see you soon 12:07 &mdash; Contest is over. Results should be availabe shortly 12:00 &mdash; Peking University  11:31 &mdash; I now accept requests for team photos ;) 11:28 &mdash; NRU ITMO:  11:25 &mdash; Taiwan National:  11:23 &mdash; SPb State: ![ ](https://lh4.googleuse...

Full text and comments »

NAC Vlogs | Final Day, Disney World, Qualified to the WF, Won Bronze and South ### First day We have North America Championship from today (May 23rd) to May 28th in Orlando, Florida. This competition is for choosing the teams qualifying to ICPC WF 2024 in Kazakhstan. I will make a vlog for each day. I'm trying to make each one of these vlogs 15 mins. My first try wasn't very successful and the first video is about half an hour. (It was good and I couldn't trim more than this) By the way, we did the real duel with [user:galen_colin,2024-05-24] and we tried to headshot each other using frisbees. We are both alive but injured. Everyday, This post will be updated by the vlog of that day. Hope you'll enjoy, feel free to give me suggestions about the next ones. And definitely wish UMD White luck :) ### Second Day I heard a sad news from Mohamed [user:Bakry,2024-05-25] today. As he said, Iran and Israel cannot attend IOI 2024 onsite and this is told to them about a year ago. I personally don't know what can we do in this situation to prevent such thin...

Full text and comments »

Teams Going to the 2026 ICPC North America Championship All regionals for the 2026 NAC have been completed. AFAIK there's been no word from ICPC on exact qualifications, but I've made some educated guesses. Will update when official info is released. Please comment the codeforces handles of your university's team if you know them, and I'll add them to the list. :) --- # **WEST** ## **[Rocky Mountain](https://rmc25.kattis.com/contests/rmc25/standings)** | University | Member 1 | Member 2 | Member 3 | | ------------------------ | -------- | -------- | -------- | | University of Alberta | [user:asiad,2025-11-29] | [user:digital_vest,2025-11-29] | [user:jxu,2025-11-29] | | Arizona State University | [user:BenjaminJ,2025-12-04] | [user:sahajrastogi,2025-12-04] | [user:tgossett,2025-12-04] | | Colorado School of Mines | [user:WhimsicalCode,2025-12-01] | [user:Dell_Know,2025-12-01] | [user:Leviathan102,2025-12-01] | | University of Calgary...

Full text and comments »

The 8th Turing Cup Tournament **UPD 1: Submitting a recording will be required in order to win (division top 3 or best female coder) prize. The format of the recording & rules are the same with [AGC](https://atcoder.jp/posts/agc_proctoring_en).** **UPD 2: We've noticed that contest is unavailable in the X-Camp Contest System. We are investigating.** **UPD 3: International contestants should also register at XinYouDui contest system.** **UPD 4: You should submit your video file(or url) to `[email protected]`.** # 2026 · The 8th Turing Cup Tournament The Turing Cup is an invitational competition that is organized by one of the most successful informatics competition teams in China, the XinYouDui and partner with X-Camp Academy. ## Timeline | Event | Time (UTC+8) | |----------------------|-----------------------------------------| | Registration Time | Jun 18, 2026, 06:00 PM &mdash; Jul 30, 2026, 12:29 PM | | Opening Ceremony | Jul 30, 2026, 07:...

Full text and comments »

ACM-ICPC World Finals Reunion Dinner 2016 ACM-ICPC World Finals Reunion Dinner was on 16th of September in the Stanford University. Vladimir Yakunin, the participant of ICPC 2005 and 2010, engineer of Google, shared his impressions about this meeting: <div style="background-color: #FAFAFA; padding: 1em 1em;"> The organizer, Doug Mohr, invited us to one of Stanford buildings. Yet on the parking I met Roman Chadnov, my friend from Tomsk. We entered the building and asked where the event was. It turned out that there were several of them. Finally we found out the garden mainly thick of young people in jeans and t-shirts who got together and didn’t pay attention to others. Many of them had badges of Google and Facebook members. Our! <br><br> In the far end of the garden there was a bar which, however, was not so popular. Waiters scurried about the programmers and offered various snacks (mmm, tunny was amazing!!!). All people fastened on their badges (actually not to make the acquaintance of everyone) and sorted out, appare...

Full text and comments »

Teams going to ACM ICPC World Final 2016 With many regionals around the world finished, I think it is time to start collecting teams that are going to World Final this year. Please help me adding information to the tables :) --- Europe ====== | **Region** | **Country** | **University** | **Member 1** | **Member 2** | **Member 3** | | --------- | ----------- | -------------- | ------------ | ------------ | ---------- | | NEERC | Russia | Ural Federal University | [user:Um_nik,2016-05-15] | [user:Umqra,2016-05-15] | [user:Merkurev,2016-05-15] | | NEERC | Russia | SPb State University | [user:Copymaster,2016-05-15] | [user:-XraY-,2016-05-15] | [user:ershov.stanislav,2016-05-15] | | NEERC ...

Full text and comments »

Eolymp Cup #2  Eolymp Cup #2 ============= We are very excited to announce [the second round of Eolymp Cup](https://basecamp.eolymp.com/en/contests/ptmnufrm6p6nl7gods1loo65go) on **6th of October at 15.00 UTC**! Take up a challenge to get a chance to win a trophy, medals, prizes, and scholarships at [Harbour.Space University](https://harbour.space/). **Eolymp Cup** is a programming competition for students. The competition consists of 4 rounds, held throughout the year. Each round features 6 problems, each designed to challenge participants' knowledge of algorithms, data structures and programming. The competition is open to everyone, but prizes will only be awarded to participants who are born after January 1, 2002. All other participants will compete unofficially. ### Registration You can register on the [contest page](https://basecamp.eolymp.com/en/contests/ptmnufrm6p6nl7gods1loo65go), just click "Joi...

Full text and comments »

Eolymp Cup #1  Eolymp Cup #1 ============= We are very excited to announce our new competition! Join us at [Eolymp Cup](https://basecamp.eolymp.com/en/contests/mufmafu7a932v5ofm9i93q65sc), a programming competition for students from everywhere! Take up a challenge to get a chance to win a trophy, medals, prizes, and scholarships at [Harbour.Space University](https://harbour.space/). **Eolymp Cup** is a programming competition for students. The competition consists of 4 rounds, held throughout the year. Each round features 6 problems, each designed to challenge participants' knowledge of algorithms, data structures and programming. The competition is open to everyone and will be held on [Saturday, July 6, 2024 at 17:00 UTC+2](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Eolymp+Cup%231+Round+1&iso=20240706T18&p1=367&ah=3). Still, prizes will only be awarded to participants who are currently enro...

Full text and comments »

Teams Going to the 2022 ICPC North America Championship The teams advancing to the NAC this year were announced today. In previous years, someone has made a post with the list of qualifying teams and their known codeforces handles. This year that person is me. If you have any of the missing data, please let me know and I'll add it to the tables. East Central North America ================== | University | Team Name | Member 1 | Member 2 | Member 3 | |-------------------------------------|---------------|------------|----------|----------| | Carnegie Mellon University | CMU1 | ~conqueror_of_tourist,2022-03-26 | ~xumingkuan,2022-03-26 | ~summitwei,2022-03-26 | | University of Waterloo | Waterloo Gold | ~pwypeanut,2022-03-25 | ~ChrisT,2022-03-25 | ~mariand,2022-03-25 | | University of Michigan at Ann Arbor | Victors | | | | | Purdue University | Purdue UWU | | | ...

Full text and comments »

2024-The 6th Turing Cup Tournament **Turing Cup Tournament** The Turing Cup is an invitational competition that is organized by one of the most successful informatics competition teams in China, the XinYouDui and partner with X-Camp Academy. **Registration time:** April 19th &mdash; May 5th 8:00 AM（BJT）/ May 4th 5:00 PM PDT/ May 4th 8:00 PM EDT **Registration method:** Click [XinYouDui contest system](https://contest.xinyoudui.com/recommend) directly for registration. So register here while you can! (It is recommended to use Chrome, Firefox browser) **Registration requirements:** There are no age, level, or identity restrictions. These awesome problems and editorials are written, prepared, and tested by the XinYouDui from Hangzhou Xuejun High School. Quality is ensured by top-notch participants of IOI 2024 China National Team and NOI gold medalists. **Divisions:** Novice, Intermediate, Advanced - Novice group: The entry-level level of programming with basic language application and basic algorithms ...

Full text and comments »

Teams Going to the 2024 ICPC North America Championship The list of teams qualified for the [2024 North America Championship](https://nac.icpc.global/) has been [posted here.](https://icpc.global/regionals/finder/North-America-Championship-2024/teams) So far, there are 48 teams there. I expect that 2 more will qualify and will update this post when they do. Please comment the codeforces handles of your university's team if you know them, and I'll add them to the list. :) Edit: There are now 50 teams. I expect that there won't be any more. Edit 2: nvm, boston shenanigans [East Central North America](https://naeast23.kattis.com/contests/naeast23/standings?filter=5332) ================== | University | Member 1 | Member 2 | Member 3 | |-------------------------------|----------|----------|----------| | University of Waterloo | [user:KevinWan,2024-03-01] | [user:uwu,2024-03-01] |[user:pwypeanut,2024-03-01] | | University of Michigan | [user:docriz,2024-04-21] | [u...

Full text and comments »

Teams Going to 2021 ICPC North America Championship Now that the advancing teams have been posted on the [ICPC website](https://icpc.global/regionals/finder/North-America-Championship-2020), I've put the attending teams below. Here's a link to the [NAC website](https://www.cecs.ucf.edu/NAC-NAPC/) (which may be updated soon?). Comment below with the handles or names of the team members of the advancing teams. Please do not post anyone's name or handle without their permission, since student names are not publicly available from ICPC (AFAIK). Let me know if any of the information below needs to be fixed. #Central Division | University | Team Name | Member 1 | Member 2 | Member 3 | | ------- | ------ | ---------- | -------- | -------- | -------- | | University of Wisconsin &mdash; Madison | teamname or NP = D?(AdjP)*N(PP)* | [user:bvd,2021-05-17] | [user:AquaBlaze,2021-05-17] | [user:ziyuan949,2021-05-17] | | University of Illinois at Urbana-Champaign | UIUC B | [user:jasonx3,2021-05-17] | [user:imbr92,2021-05-17] | [user:e...

Full text and comments »

Teams Going to the 2023 ICPC North America Championship Most North America ICPC regionals have been held. While we don't yet know who is going to NAC, it's reasonable to guess that the slot distribution will be similar to last year. So here is a list of teams who qualified for NAC assuming the same distribution. Note that all regions are guaranteed at least 3 slots, and I would be relatively surprised if any region received less than 4. Update: It looks like an official list has been [posted here](https://icpc.global/regionals/finder/North-America-Championship-2022/teams). I've updated the tables below in accordance, with the exception of Pacific Northwest, which has some irregularities. Update 2: UC Davis now appears on the list, so everything seems normal now. 48 total teams invited. Update 3: Stony Brook University and Northeastern University have been added to the list, for a total of 50 teams. I expect there will be no more additions beyond this. If you know the codeforces handles of any team that is not yet filled in, ple...

Full text and comments »

Rockethon 2014 Overview Hello Codeforces community, I am happy to announce that Rocket Fuel Inc. will soon be hosting a contest called Rockethon on Codeforces. The contest is prepared by Rocket Fuel employees Jon Derryberry, Alexander Ruff and me, Eldar Bogdanov. We hope you will have as much fun solving the problems as we had crafting them. The contest will feature prizes and T-shirts for top performers. Also, Rocket Fuel is interested in hiring the best of you after this event, so let me tell you about the company and why you would want to join us. ### About Rocket Fuel Rocket Fuel is building technology platform to do automatic targeting and optimization of ads across all channels — display, video, mobile and social. Our pitch to advertisers is very simple "If you can measure metrics of success of your campaign, we can optimize". We have run campaigns for many large advertisers. Examples include BMW, Pizza Hut, Brooks Running Shoes and many more! We buy all our inventory through real time biddi...

Full text and comments »

Eolymp Cup #4  Eolymp Cup #4 ============= Get ready for the [final round of the Eolymp Cup](https://basecamp.eolymp.com/en/contests/ajbi7s2jld37fch2ulvjkvgi9g) happening on **Sunday, March 2**! Compete for a chance to **win free HSU scholarships, Eolymp subscriptions**, and our **exclusive T-Shirts**. Don’t miss out on the action—we’re excited to see you there! ### About **Eolymp Cup** is a programming competition for students. The competition consists of 4 rounds, held throughout the year. Each round features 6 problems, each designed to challenge participants' knowledge of algorithms, data structures and programming. The competition is open to everyone, but prizes will only be awarded to participants who are born after January 1, 2002. All other participants will compete unofficially. ### Format and Duration In each round, you are given 3 hours to solve 6 problems. Each problem is split into sub-t...

Full text and comments »

Looking for Teaching Assistants for the Summer in Ethiopia and Jamaica (Expenses Paid) Hey CodeForces, Last year I was a TA in AddisCoder, a non-profit 4-week course to teach programming to the best high schoolers in Ethiopia, some of the alumni have gone to Harvard, MIT or Stanford. As a TA I was there from July 21st to August 22nd (we went one week before the course started to prepare materials, get to know each other and visit Ethiopia!). The role of a TA is to answer 1:1 questions from the students in lab, with the goal of making sure each student grasps the concepts and can go through the exercises by themselves. Some of the typical questions are: Why this doesn't work? I don't understand X, or if X happens why doesn't Y happen? etc. My experience there was amazing, the TAs became very close and really good friends, we had tons of fun together, and with the students too! Another thing we really enjoyed was Ethiopian culture, there were some traditional restaurants that we used to go that showed them and was really fun. The same program is also available...

Full text and comments »

The results According to <a href="http://acm.math.spbu.ru/%7Esnark/finals/index.cgi?data=newstape&amp;class=final2010&amp;year=2010">Snarknews</a> (in Russian only), Shanghai JTU has become the World Champion for the third time (2002, 2005, 2010), this means it has the same number of victories as the Stanford University and the SPbSU ITMO.<br> <br> <div>Then goes the Moscow State University (Gusakov, Kornakov, Razenshtein) - the European Champions! Congratulations to the team and to their coach Anton Pankratiev!</div> <div> <br>The next one is the biggest surprise of this contest (IMHO) - Taiwan National University. Personally for me it was a pleasant surprise, because in November <a href="http://picasaweb.google.com/ivanromanov/Taiwan">I visited Taiwan</a> - a nice island! I recommend it to everyone. It was my first trip to Asia, a good start .<br> <br>The following two teams - Kiev State University (Grinenko, Neiter, Simonenko) and Petrozavodsk State...

Full text and comments »

Push Relabel Algorithm Tutorial The main difference between Augmenting path algorithms and Push-Relabel is that: - Augmenting path algorithms maintain a flow(capacity constraints and conservation constraints are valid) and augment it some s-t path in each iteration to increase its value. We iterate untill there exists no s-t path in the current residual network. - Push-Relabel algorithm takes a different approach, it works with pre-flow(conservation constraint is violated &mdash; the amount of flow into a vertex can exceed the amount of flow exiting it, the difference(`flow_in-flow_out`) in the amount present at that vertex is called excess, excess >= 0). This algorithm starts with a pre flow and terminates with an actual flow, eliminates all the excesses. We start with s-t disconnected and work towards a feasible flow. To eliminate excess at a vertex it has the following function: ~~~~~ Push(v): choose an outgoing edge (v, w) of v in Residual graph G_f (if any) // push as much flow as possible ...

Full text and comments »

Eolymp Cup #3  Eolymp Cup #3 ============= Get ready for the [third round of the Eolymp Cup](https://basecamp.eolymp.com/en/contests/s9jjggk0op4b55163d4t9l39nc) happening on **Sunday, December 15**! Compete for a chance to **win free HSU scholarships, Eolymp subscriptions**, and our exclusive **Evil Chmyaaax T-Shirt**. Don’t miss out on the action—we’re excited to see you there! ### About **Eolymp Cup** is a programming competition for students. The competition consists of 4 rounds, held throughout the year. Each round features 6 problems, each designed to challenge participants' knowledge of algorithms, data structures and programming. The competition is open to everyone, but prizes will only be awarded to participants who are born after January 1, 2002. All other participants will compete unofficially. ### Format and Duration In each round, you are given 3.5 hours to solve 6 problems. Each problem i...

Full text and comments »

Advanced Algorithms and Complexity Course I [wrote](http://codeforces.me/blog/entry/44924) in May about the launch of [Data Structures and Algorithms](https://goo.gl/jV5fbe) Specialization at Coursera. In September, the [Advanced Algorithms and Complexity](https://goo.gl/TalA42) Course of this Specialization was launched, and I'd like to tell you more about it. Course topics: 1. Network Flows (Ford-Fulkerson and Edmonds-Karp algorithms). 1. Linear Programming (the Simplex Method). 1. NP-completeness (theory, reductions, solving NP-complete problems using SAT-solvers). 1. Coping with NP-completeness (bruteforce optimizations, solvable cases, approximation algorithms). 1. Streaming Algorithms. The problems for this course were prepared by [user:ifsmirnov,2016-10-03], [user:Ilyakor,2016-10-03], [user:Michael,2016-10-03], [user:Perlik,2016-10-03], [user:romanandreev,2016-10-03], [user:Zlobober,2016-10-03] and Paul Melnichuk. Network flows and the algorithms covered in the Specialization can sound as not very advan...

Full text and comments »

The Backstory Behind UC Berkeley’s Performance at ICPC Regionals As some of you may know, ICPC North America held its 13 regional contests this weekend, with top teams from each region advancing to the North American Championship in May. Our region, Pacific Northwest, ended up being one of the craziest and most fun competitions I’ve ever participated in, so I decided to write this blog to share our contest experience this weekend and some of the backstory behind our team selection process. Our story begins in August 2021, when I was an incoming freshman at UC Berkeley eager to participate in ICPC after two years of grinding CP during COVID. As soon as I arrived at Berkeley, however, I was shocked to learn that despite being one of the highest-ranked schools in the country for CS, we had no active competitive programming club! Nonetheless, I still found several other competitive programming enthusiasts to practice with early on, including [user:vkgainz,2023-02-26] and [user:Badint,2023-02-26], and I ended up formed a team with [user:vkgainz,2023-0...

Full text and comments »

Topic wise Coding Resources So I made this listing for topic wise coding resources. It is open sourced [here](https://github.com/hkirat/awesome-competitive-coding) Thought of sharing it here too! # Awesome Competitive Coding [](https://github.com/sindresorhus/awesome) A Curated list of Topic wise Theory and Questions to Get You Started On Competitive Coding. *Inspired by the [awesome](https://github.com/sindresorhus/awesome) list thing. You might also like to read complete [awesome-list](https://github.com/sindresorhus/awesome).* ### Contributing Kindly Go Through [Contribution Guidelines](https://github.com/hkirat/awesome-competitive-coding/blob/master/CONTRIBUTING.md) First. Topics --- - Binary and Ternary Search - Dynamic Programming - Flow - Game Theory - Graphs - Greedy - Maths - Matrix Exponentiation - Miscellaneous - Prefix and Suffix Trees - Segment Trees...

Full text and comments »

TeamsCode Spring 2023 Contest Hello Codeforces! [TeamsCode](http://teamscode.org) is excited to announce the [TeamsCode Spring 2023 Virtual Programming Contest](https://www.teamscode.org/contests/spring-2023)! It will take place on [April 2nd, 2023 at 9:45 AM PST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TeamsCode+Spring+2023+Contest&iso=20230402T0945&p1=1239&ah=3). **Teams of up to 4 members will have 3 hours to solve around 10 problems.** There are two divisions: Novice and Advanced, so no matter what skill level you are, there is a place for you. The guest speaker events will feature **Dr. Subho Majumdar**, a technical leader in applied trustworthy machine learning who believes in a community-centric approach to data-driven decision-making, and **Dr. Jane Bae**, an Assistant Professor of Aerospace at the Graduate Aerospace Laboratories at Caltech. She received her Ph.D. in Computational and Mathematical Engineering from Stanford University in 2018. She was a postdoctoral fellow in the Grad...

Full text and comments »

The Fear of Gaussian Elimination Recently, I was asked to help flesh out a problem for the [NAIPC 2019](http://naipc19.kattis.com) contest whose problems are also used every year as the "Grand Prix of America." Although I didn't create or invent the problem, I helped write a solution and created some of the test data for [Problem C, Cost Of Living](https://naipc19.kattis.com/problems/costofliving). From the problem setter's perspective, this was intended to be an easy, A-level problem: suppose you have a table of values $a_{y,c}$ that meet the condition that: $a_{y, c} = b_c m_c^y \prod_{k<y} i_k$ for some $m_c > 0$. If you are given a subset of the values in this table, and a subset of the values for $i_k$, determine whether a set of queried values $a_{y', c'}$ is uniquely determined or not. Note that $a_{0, c} = b_c$. Most contestants immediately realized that above product can be written as a linear combination/sum by taking the logarithm on both sides: $\log{a_{y, c}} = \log{b_c} + y \log{m_c} + \...

Full text and comments »

Alternative Solution to 1421 D. Hexagons using Linear Programming & Total Unimodularity Hi, this is my first blog tutorial. I'll be talking about an alternative solution for [1421 D. Hexagons using total unimodularity](https://codeforces.me/contest/1421/problem/D) using Linear programming and Total unimodularity. # Introduction **(Skip if familiar with Linear programming)** So what is linear programming? Linear programming aims to answer the following question: Problem: Given real (double numbers) $c_1, ..., c_n$ and $b_1, ..., b_m$, and a matrix $A$ of size $m\times n$, you want to find $x_1, ..., x_n \geq 0$ that maximize $\sum_{i=1}^n c_i x_i$ subject to the constraints $\sum_{i=1}^n A_{j,i}x_i \leq b_j$ **for all** $j=1, ..., m$. Let's take an example. Suppose $c=(1,2), b=(2,3),$ and $$A=\begin{bmatrix} 1 & 3 \\ 3 & 4 \end{bmatrix}$$ then we want to find $ x_1, x_2 \geq 0 $ that maximize $x_1+2x_2$ subject to $x_1+3x_2 \leq 2$ and $3x_1+4x_2 \leq 3$. In this case, one can verify graphically (by plotting objective function and the constraints) t...

Full text and comments »

Teen Web3 & AI Conference @ Stanford Web3 and AI meet their future generation. ========================================= ###### _Note that for those who have signed up already, the date has changed and you must re-register_ ALPHAG3N, working with sponsors such as Coinbase, Solana Foundation, Jetlearn, and partners such as Stanford Blockchain Club, is the world’s largest high school Web3 and AI community, and we are looking for you to join us! On April 23rd, at Stanford University, we will be hosting a Web3 and AI conference for teen enthusiasts (age 13-19) from all backgrounds and inviting speakers such as Sanchan Saxena and Ejaaz Ahamadeen. Throughout the day, there will be a panel session for all participants and five workshops to choose from for those who join us (workshop leads to be announced soon). For in-person participants, there will be free food, merchandise, and $1000 in raffle prizes. More details can be found at [https://alphag3n.com/](https://alphag3n.com/). For those of you interested in Web3, AI, an...

Full text and comments »

Automating reduction on algebraic expressions I recently stumbled upon a problem from Stanford Local ACM Programming Contest (SLPC) 2011. <br> [(contest info)](https://cs.stanford.edu/group/acm/oldsite/SLPC2011/) <br> [(try the problem yourself here)](https://www.acmicpc.net/problem/7636) <br> So the problem is, in short, given algebraic expressions of trigonometry like $x(sin^2x + cos^2x) − x$, you have to determine whether each expression equates to zero. <br> The intended solution, I am assuming, is to <br> 1) convert the input string into a function of $x$ that returns the value, under the same process the expression is described, <br> 2) input multiple values of $x$ into that function, and <br> 3) confirm the identity if the function always returns zero &mdash; within the bounds of float precision error. <br> Unaware of this idea, I initially tried to solve this problem by building a recursive reduction algorithm. <br> Using the F# language, I made a custom algebraic data type, with a set of rules, such as $s...

Full text and comments »

Teams going to ACM-ICPC World Finals 2019 Completed List! [user:Luqman,2019-01-30] said he [isn't creating a chart](https://codeforces.me/blog/entry/64899?#comment-488294) of teams going to ACM-ICPC this year as he isn't competing, so I added in all the teams. Let's complete the table together! For the teams where I don't know the cf handles of the team members, I put their names instead. Europe ====== | Count | Country | Region | University | Member 1 | Member 2 | Member 3 | | ----- | ------- | ------ | ---------- | -------- | -------- | -------- | | 1 | Romania | SEERC | Alexandru Ioan Cuza University of Iași | [user:Juve45,2019-01-31] | [user:Cristian1997,2019-01-31] | [user:Sin,2019-01-31] | | 2 | Switzerland | SWERC | ETH Zürich | [user:TimonKnigge,2019-03-08] | [user:zaspagety,2019-03-08] | Stefanie Zbinden | | 3 | Netherlands | NWERC | Leiden University | [user:pimsp,2019-03-08] | Onno Berrevoets | Daan van Gent | | 4 | Ukraine | SEERC | National Technical University "Kharkiv Polytechnic Institute" | [user:vlad8,2019-02-0...

Full text and comments »

How to prepare for ACM ICPC? Well I would suggest you to check out Programming Competition,Programming Contest,Online Computer Programming. Here is the details about as the codechef team promote the students for ACM-ICPC or you can also check out the actual university site which conduct ICPC The ACM-ICPC International Collegiate Programming Contest And to practice problems you can you can refer following sites 1. http://codechef.com 2. http://spoj.com 3. http://hackerrank.com 4. http://codecademy.com 5. http://topcoder.com 6. http://codeforces.com Good Luck... for the details about ACM-ICPC 2015 you can read the details ACM ICPC 2015 | CodeChef. I hope you'll find most of the things... Here are some steps to get started and be good at it. Get comfortable writing code in either of one of these languages C, C++ or Java. Why only C, C++ or Java? Because these are the standard languages allowed in any programming competition. If you are already good at C, it is suggested to learn C++. It...

Full text and comments »

Free Beginner CP course!! Hi Everyone, My friend, Anish Reddy, and I, Locke Cai, started a non-profit called **Empower** Anish is a high school sophomore who is interested in journalism and business management, and he won first place at the Wharton Investment Competition!! He has a variety of interests ranging from reading books to watching sports. He is excited to lead Empower and looks forward to promoting education to unprivileged youth worldwide. I am a high school sophomore who has a deep interest in math and computer science. I am currently a Platinum competitor in USACO, and I also qualified for USAJMO. Aside from that, I love to give back to my community through any means which is why I am thrilled to start Empower! We founded Empower to help solve the educational disparities in STEM and business related fields because many underprivileged students don't have access to high-quality STEM and business education. At Empower, we provide cost-free education in competitive programming and economic...

Full text and comments »

How Codeforces Catches Cheaters: A Look Inside Plagiarism Detection If you've competed on Codeforces long enough, you've probably seen the aftermath of a plagiarism sweep — ratings quietly rolled back days after a round, a wave of "why did I lose rating?" posts, someone's submission flagged with a red "SKIPPED" or a hack. Ever wondered what's actually happening behind the scenes? Here's a breakdown of how automated code-similarity detection works, and why it's harder to dodge than people think. The core problem: comparing everyone to everyone A typical Div. 2 round pulls in tens of thousands of submissions per problem. To catch copied code, you'd naively need to compare every submission against every other submission — that's roughly O(n²) pairs. For 30,000 participants, that's on the order of 450 million comparisons per problem. Even at a blistering 10,000 comparisons per second, that's over 12 hours of raw compute for one problem alone. This is exactly why plagiarism results don't show up immediately after a contest. Ratings get updated firs...

Full text and comments »

Interview with TheOneYouWant, ask anything! Hello everyone, Upd: Livestream has been scheduled. [Time in your timezone](https://www.timeanddate.com/worldclock/fixedtime.html?day=3&month=02&year=2024&hour=23&min=35&sec=0&p1=1799). You can tune in here. Upd2: We recorded it with live audience today. Audio was lagging at some places. I will edit it by next week and upload it. I wanted to share some exciting news with you. Recently, I launched my [YouTube channel](https://www.youtube.com/@aryanc403?sub_confirmation=1) and created a [community Discord server](https://discord.gg/gs5PSVuTfV). Up until now, I've mainly focused on hosting [post-contest](https://codeforces.me/streams/aryanc403) discussion streams on my channel. However, I have plans to diversify the content. To kick things off, I'm thrilled to announce that I've invited my arch-rival, and my best friend, [user:TheOneYouWant,2024-01-17], to join me for an Ask Me Anything (AMA) session on my channel. We are planning to record this AMA sometime next month. ...

Full text and comments »

Quantum Coalition Hack *I sometimes get messages from Codeforces members asking about the next installment of the Q# Coding Contest series. I don't have any news to share on that topic, but here is a quantum computing Hackathon that might be of interest for people who enjoyed Q# Coding Contests.* [Quantum Coalition Hack](https://www.qchack.io/) is a quantum computing Hackathon hosted jointly by Yale Undergraduate Quantum Computing and Stanford Quantum Computing Association. Only undergraduate and graduate students worldwide are eligible to participate in the Hackathon part of the event, but everyone is welcome to attend the pre-Hackathon bootcamp on **April 5-9** featuring tutorials and networking sessions. During the Hackathon itself, held on **April 10-11**, sponsor companies will offer programming challenges that can be solved using their technologies. You can read more about [the challenge Microsoft Quantum team will offer](https://devblogs.microsoft.com/qsharp/announcing-microsoft-quantum-challeng...

Full text and comments »

Олимпиадное программирование и выбор вуза Disclaimer: я понимаю, что codeforces не самое лучшее место для такого поста. Что всем более интересны соревнования и прикольные задачки. Просто мне интересно мнение именно сообщества Codeforces по этому поводу. я понимаю, что таким спорным постом солью вклад, поэтому пишу с левого аккаунта. Я понимаю, что таким образом в некотором смысле проявляю неуважение к сообществу, поэтому заранее прошу у вас прощения. ***Осторожно! многабукаф*** Стало интересно: почему там много крутых олимпиадных программистов выбирают не самые топовые вузы для дальнейшего образования? Почему так мало олимпиадников идёт куда нибудь в MIT, Stanford, Harvard и в другие подобные места? Если сопоставить места, где учаться спортивные программисты и фавориты рейтингов 1) https://www.topuniversities.com/university-rankings/university-subject-rankings/2018/computer-science-information-systems QS University Ranking (Computer Science) 2) https://www.timeshighereducation.com/world-university-rankings...

Full text and comments »

Технологии успеха: Тернистый путь к полуфиналу Продолжаем погружаться в историю спортивного программирования в России — с согласия авторов делюсь частями книги В.Н. Васильева и В.Г. Парфенова «Технологии успеха». Рисунки и фотографии — также из книги. Предыдущая часть: [Технологии успеха: Начало пути](http://codeforces.me/blog/entry/45199) <hr><hr> <center> <img src="http://codeforces.me/predownloaded/4b/b5/4bb5694286f1db82b86950e73eae632e668927d0.png"/> </center> Эта же осень (Прим.: 1994 год &mdash; Codeforces::News) ознаменовалась приходом в Россию олимпиад АСМ. В сентябре на кафедру «Компьютерные технологии» (Прим.: Университета ИТМО &mdash; Codeforces::News) буквально «ворвался» Антон Суханов, размахивая плохо пропечатанной факсовой лентой, на которой никому не известная у нас организация АСМ приглашала российских студентов в Бухарест на какую-то студенческую олимпиаду по программированию. «Владимир Глебович! -темпераментно рисовал радужные перспективы Антон, &mdash; собираем супер команду из Елизарова, ...

Full text and comments »

ICPC WF 2026 Team List Hello Codeforces, Earlier this month, the ACPC (African and Arab Collegiate Programming Championship) concluded, determining the teams qualified for the ICPC World Finals from our region. I decided to write a blog post to gather the full team list somewhere (yes, I know this is very early and most championships are still in March, but I'm so excited anyway, and I already had the script for the ACPC list, so why not!) To add your team to the list, please comment these details: - Your region - Your country - Your university - Your team name - Team members' handles Wish everyone the best of luck in preparing for the ICPC, and can't wait to meet you all! <h2>Northern Eurasia</h2> <table> <tr> <th>Country</th> <th>University</th> <th>Team Name</th> <th>Member 1</th> <th>Member 2</th> <th>Member 3</th> <th>Team Rating</th> </tr> <tr> <td>Russia</td> <td>HSE University</td> <td>FFTilted</td> <td><a href="https://codeforces.me/profile/teraqqq" style="color...

Full text and comments »

2011-2012 Stanford Local Contest <p>Hey everyone,</p><div>There are no CodeForces rounds coming up, so I thought I would set up a training round in the new Gym. The problems are from our local contest which I helped organize last October. We used it to select our team for the ACM-ICPC. There is a large range of problem difficulties, so I am sure everyone will have interesting problems to solve.</div><div><br /></div><div>It will be held on <a href="http://timeanddate.com/worldclock/fixedtime.html?day=28&amp;month=1&amp;year=2012&amp;hour=8&amp;min=0&amp;sec=0&amp;p1=166">Saturday, 1/28 at 8am Moscow time</a> (4-hour contest) <b>in the CodeForces Gym</b>. I hope you enjoy the problems!</div><div><br /></div><div><b>Update:</b> The contest is over. Thanks for participating! If you didn't, please check out the problems anyway :) Feel free to discuss the problems in the comments below; I can outline solutions but I don't have a formal editorial.</div>

Full text and comments »

Competitive programming for a BEGINNER(like me..:)).... First do a self analysis (truthful) &mdash; don’t assume you are the best or the worst. List the areas to improve, Language skills &mdash; C++/Java Math skills Data structures &mdash; including the tough ones Trees, Graphs etc. Algorithms (not just simple sorting, but advanced ones that’s required for competitive programming). Once you have a fair idea, then start work &mdash; be humble enough to admit you do not have the skills of Anudeep Nekkanti or Ashish Kedia at the beginning. Keep a small goal to solve enough Div-II 250 problems without peaking into solutions, then 500 pointers, and then 1000 pointer in Div-II. During this process, you can learn and improve your skills in implementation, solving and speed. The process will be slow and may take up to 2–3 years, be patient and measure growth in each step. As you slowly climb the steps, your confidence will improve and one day can be among the top programmers. The most important point is to not loose patience, and wh...

Full text and comments »

MAY Long Codechef — CHEFCK Hello, The May Long contest just concluded. I need some help regarding the problem CHEFCK. Unfortunately I couldn't solve it , even though I tried it for 4-5 days :( . (http://www.codechef.com/MAY15/problems/CHEFCK). I would describe my approach(es) to this problem and would appreciate it if someone could tell me where my thought process was slow/wrong. All of my codes are correct, I couldn't clear the 3rd subtask of the problem. 1st Approach ================== I initially , tried solving it by using A segment tree. The time was O(n + Q*log(2*k)), it timed out. the link &mdash; http://www.codechef.com/viewsolution/6912313. 2nd Approach ================== I then got to know about Range Minimum Query from Topcoder. I read the article and then built the sparse table as described. Even that timed out. I divide the table into blocks of size log(n) and create a ST on the block minimums and then create ST for each and every block. Even this timed out. ...

Full text and comments »

Memories: ACM-ICPC World Finals 2009 <p> <img src="http://lh6.ggpht.com/_mSdPzSw5zAo/S2KKSsTdWyI/AAAAAAAADGE/vpMUDSuenS0/IMG_0494.JPG" style="float: left;margin: 1.0em;"> The World Finals of the 33rd International Collegiate Programming Contest for was held in the capital of Sweden, Stockholm. The contest was held in Europe for the third time: in 1999 it was held in Eindhoven (the Netherlands), in 2004 - in Prague (the Czech Republic). It was the first time the key role in the competition had been played by the University: it was held in the library of the Royal Technological University. One hundred best teams of the world took part in the final, while the preliminary rounds saw 7109 teams from 1838 Universities and 88 countries competing. It was the sixth time the Saratov State University had took part in ACM-ICPC World Finals. </p> <p> The participants were placed in two hotels in the historic centre of Stockholm, Gamla Stan district. Our team was placed in the Gran...

Full text and comments »

An awesome list for competitive programming! This is a project I started from late January 2016. My motive is that: Although there's fantastic information out there, I think they're still spread all over the place. Therefore, in my opinion it would probably be cool if there's an awesome list for competitive programming! ( It's now featured on the main list! ) I'm actively updating the list here: https://github.com/lnishan/awesome-competitive-programming Awesome Competitive Programming Awesome A curated list of awesome Competitive Programming, Algorithm and Data Structure resources. Created with a view to connecting people to information, this list below contains a complete collection of all the fantastic resources I've collected over the course of my 11-year competitive programming career. I hope you'll find it useful :) What is competitive programming? — Quora Contributing Please kindly follow CONTRIBUTING.md to get started. You can also contribute by sharing! Share the list with your classmates, your friends and eve...

Full text and comments »

C++ Grandmaster Certification Programming Assignment 1 22 Feb 2013 &mdash; San Francisco, CA &mdash; The CPPGM Foundation (www.cppgm.org) released further news today about the C++ Grandmaster Certification, the free massively open online course (MOOC) where you build your own C++ compiler, standard library and toolchain for Linux x86-64. It was reported that 10,000 programmers have enrolled in the course including people from Intel[*], Stanford[*], Google[*], MIT[*], IEEE[*], Harvard[*], and many other companies and educational institutions from all over the world. CPPGM has been inundated with requests for more information about the content of the course, so Programming Assignment 1 has been released as a public preview for free anonymous download and review. Programming Assignment 1 asks the participant to implement the first three phases of translation as described in clause 2 of the C++ Standard (the preprocessors tokenizer). The starter kit is available from: http://www.cppgm.org/pa1.html By popular ...

Full text and comments »

MULTI-PLATFORM CODE PLAGIARISM CHECHER With an increasing number of cases of cheating in Codeforces and Codechef contests, I am trying to set up a **Multi-platform code plagiarism checker using MOSS tool developed by Stanford.** The plagiarism checker is working perfectly fine, now I just want to figure out **a way to download all Accepted solutions of a SPECIFIC PROBLEM from all users** to run the test on them. Can anyone help me with it?

Full text and comments »

What should be the strategy of using automatic system to detect code plagiarism? Recently, I have seen a lot of blogs talking about the issues of cheaters. Therefore, I am currently thinking about using automatic system to catch them. Currently, the most well-known automatic system for assisting of detecting plagiarism is MOSS(from Stanford). At first, I asked myself, why did not Codeforces use them? However, I look at the number of participants of each contests; it turns out that the count is approximately under 30000. So, we have to compare $4.5*10^8$ pairs of source code! Assuming that the system can check $10^4$ pairs per second, we will need $45000$ seconds, which is just more than half a day, the same length as hacking procedure of Educational Rounds. But I believe that limit is much lower (I have not used it). Is there any assistance like that could run that fast, if not MOSS? Is there any solutions that can drop the complexity of $O(n^2 * t)$? (assuming $t$ is the time for comparing a pair of code)

Full text and comments »

Test cases in GYM problems. Hi, today I've experienced the weird fact that I'm unable to see the test case which I failed, and the code of other contestants in the Gym problems, I'm practicing in '2011-2012 Stanford Local Contest, 8 October, 2011' problem B: http://codeforces.me/gym/100015/attachments, I'm pretty sure my code is right, but I'm unable to see even my answer for the first test case, which returns to me 'Wrong Answer', does someone knows what is wrong in my code or what is the possible error ? EDIT: code moved to: http://pastebin.com/creXK21E

Full text and comments »

How does Dinic's Max Flow compute the blocking flow in O(NM) complexity ? I've been trying to understand Dinic's Max Flow algorithm. I think I've fairly understood how the algorithm works. In each iteration, you create a level graph using BFS and then find blocking flow in that level graph. You would need **O(N)** iterations and in each iteration, blocking flow can be found in _**O(NM)**_ complexity. This is the place where I'm stuck. I've seen some implementations like [ Stanford Notebook Dinic implementation ](https://github.com/jaehyunp/stanfordacm/blob/master/code/Dinic.cc). But it seems to me that in the worst case you might need _**O(M^2)**_ complexity to find the blocking flow if you implement the code this way. Can anyone help me to understand why the complexity is _**O(NM)**_ for finding blocking flow ?

Full text and comments »

2012 Fantasy Football Sleepers 1 of the keys to winning a fantasy football league is the capacity to draft Sleepers. "Sleepers" are NFL players who are drafted in significantly decrease rounds in your fantasy football drafts than their ending statistics warrant. We have noticed championships won on the heels of unknowns this kind of as Miles Austin in 2009 and Arian Foster in 2010 and rookies coming of age significantly faster than expected, such as Cam Newton in 2011. They have come out of nowhere to register monster years soon after becoming double-digit or waiver wire picks. No 1 expected that. When you can grab a player at the finish of your draft that turns into your amount one producer at a specified place, you, my buddies, have a real Sleeper. Under are projected fantasy football sleepers by place for the 2012 season.<br/><br/>2012 Fantasy Football Sleepers<br/>QB: Carson Palmer (Oakland) &mdash; Palmer worked his way out of Cincinnati and into an additional starting work <a href="http://www.webbearsfanstore....

Full text and comments »

Mark Zuckerberg Speech I want to share a funny thing I found. Recently, I was watching very inspirational address speeches of important tech people such as Steve Jobs in Stanford University, Steve Wozniak in Berkeley, Bill Gates in Harvard, and so on. I was feeling very enthusiastic about all of these fabulous talks, so I decided to look on Youtube for an address speech of Mark Zuckerberg. I clicked on the first video which was "Mark Zuckerberg speech to 8th graders." Clearly, the 8th graders were talking to each other, not caring much about Mark, and the speaker introduced him as "Mark ZuckerMan." All of these while Mark had an expression of "How did I get here?" Oh Mark, what happened? At least you got your address speech :P Link to video: http://www.youtube.com/watch?v=c5m2f4bGtDg

Full text and comments »

Teams for ACM ICPC World Finals 2015 — Marrakesh, Morocco I'm planning to make a scoreboard for the ACM ICPC World Finals 2015, the scoreboard will contain the TopCoder and Codeforces handles for the contestants. It will be similar to [this one](http://a2oj.com/ICPC.jsp) (but with some more improvements). Please post the Codeforces handles for the qualified teams here. I'll keep updating this post once I get any new information. Any suggestions for the scoreboard are welcome for sure. I'll add all the handles I get in the following table: | | Country | University | Contestant 1 | Contestant 2 | Contestant 3 | |:--:|:--:|:--:|:--:|:--:|:--:| | 1 | Russia | St. Petersburg National Research University of IT, Mechanics and Optics | [user:tourist,2015-05-19] | [user:qwerty787788,2015-05-19] | [user:VArtem,2015-05-19] | | 2 | Japan | The University of Tokyo | [user:rng_58,2015-05-19] | [user:semiexp,2015-05-19] | [user:wrong,2015-05-19] | | 3 | China | Shanghai Jiao Tong University | [user:AngryBacon,2015-05-19] | [user:rowdark,201...

Full text and comments »

Teams going to ICPC WF 2022 (Egypt 2023) — WIP List Hi there! While we're waiting for the formal invitations to the ICPC World Final 2023, let's start the new post for the incoming competition, keeping the same idea of the [previous blog](https://codeforces.me/blog/entry/102593) As many of you already know, next WF will be something like a two-in-one competition, without knowing the actual format yet. I think it would be good to make two differents post, one per WF, because otherwise it would probably be a _very long_ post. Anyway, let the people decide :) _(I don't know if this poll works)_ Two posts: The same post: At least for now, we'll fill this post with teams of **THE FIRST WF** in Egypt, assuming that those are the qualified from Regionals **2021/2022**. (Trying to be more specific: the teams that qualified in the Regional held after the one that qualified to Dhaka) Please add a comment with your team information and I will add it to the post. Info preferre...

Full text and comments »

Stanford ICPC : Gaussing Game Hi everyone, The problem which I've been stuck on is: http://cs.stanford.edu/group/acm/slpclive/problems/G.pdf Can someone please give me some hints / idea how to solve this problem? Cheers

Full text and comments »

Teams going to ICPC WF 2024 (Kazakhstan 2024) — WIP List Hi there! While we're waiting for the formal invitations to the ICPC World Final 2024 &#127880;, let's start the new post for the incoming competition, keeping the same idea of the previous blogs. Please add a comment with your team information and I will add it to the post. Info preferred: **{Handles on CF (otherwise, real name), Region, Country, University}** If you see some mistake on the teams, any kind of correction would be appreciated &#128516; </table> # Top 15 Over-All <table><thead><tr><th>Rank</th> <th>Country/Region</th><th>University</th> <th>Member1</th> <th>Member2</th> <th>Member3</th> <th>Rating</th></tr> </thead> <tr><td>1</td><td>USA</td><td>Swarthmore College</td><td>[user:Geothermal,2024-09-08]</td><td>[user:silxi,2024-09-08]</td><td>[user:nitrousoxide,2024-09-08]</td><td>3569.1801 </td></tr> <tr><td>2</td><td>China</td><td>Tsinghua University</td><td>[user:Rebelz,2024-09-08]</td><td>[user:qazswedx2,2024-09-08]</td><td>[user:hehezhou,2024-09-08]...

Full text and comments »

Good course CS97SI Very good course archive for competitive programming: [link](http://web.stanford.edu/class/cs97si/) I learned a lot from this course alone. Thanks to Jaehyun Park(Stanford)

Full text and comments »

Teams going to ICPC WF 2023 (Egypt 2023, 2nd final) — WIP List Hi again! As we decided in [the other blog](https://codeforces.me/blog/entry/116946), let's have two differents lists, one per WF that will be held on Egypt. We'll fill this post with teams of **THE SECOND WF** in Egypt, assuming that those are the qualified from Regionals 2022/2023. Please add a comment with your team information and I will add it to the post. Info preferred: **{Handles on CF (otherwise, real name), Region, Country, University}** If you see some mistake on the teams, any kind of correction would be appreciated, also if you see here a team that belongs to the other post (or viceversa), let me know. </table> # Top 15 Over-All <table><thead><tr><th>Rank</th> <th>Country/Region</th><th>University</th> <th>Member1</th> <th>Member2</th> <th>Member3</th> <th>Rating</th></tr> </thead> <tr><td>1</td><td>Japan</td><td>&#129353; Tokyo Institute of Technology</td><td>[user:potato167,2024-05-01]</td><td>[user:tatyam,2024-05-01]</td><td>[user:noshi91,2024-05-...

Full text and comments »

Final ICPC World Finals 2019 Team Ratings — What is your prediction? <table><thead><tr><th>Rank</th> <th>Country or Region</th> <th>University</th> <th>Member1</th> <th>Member2</th> <th>Member3</th> <th>Team Rating</th></tr> </thead> <tr> <td>1</td> <td>Russia</td> <td>Moscow State University</td> <td>[user:LHiC,2019-04-01]</td> <td>[user:V--o_o--V,2019-04-01]</td> <td>[user:V--gLaSsH0ldEr593--V,2019-04-01]</td> <td>3441.929</td> </tr> <tr> <td>2</td> <td>USA</td> <td>Massachusetts Institute of Technology</td> <td>[user:xyz111,2019-04-01]</td> <td>[user:ecnerwala,2019-04-01]</td> <td>[user:ksun48,2019-04-01]</td> <td>3336.429</td> </tr> <tr> <td>3</td> <td>Japan</td> <td>The University of Tokyo</td> <td>[user:sigma425,2019-04-01]</td> <td>[user:maroonrk,2019-04-01]</td> <td>[user:yosupo,2019-04-01]</td> <td>3118.398</td> </tr> <tr> <td>4</td> <td>Poland</td> <td>University of Warsaw</td> <td>[user:Radewoosh,2019-04-01]</td> <td>[user:Chameleon2460,2019-04-01]</td> <td>[user:oxytocyna,2019-04-01]</td> <td>3059.272</td> </tr> <tr> <td>5</td> <td>Sout...

Full text and comments »