Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js

By jqdai0815, history, 2 days ago, In English

Hello, Codeforces!

We are pleased to invite you to IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2).

The Preliminary Contest is a rated contest for Div. 1 + Div. 2, taking place on Jan/20/2025 17:35 (Moscow time). The problems for this round were prepared by jqdai0815 and orzdevinwang.

The top 50 contestants at least 18 years old will be invited to participate in the onsite finals. We will cover the travel expenses for onsite contestants. The finals are scheduled to take place in CUHK from February 27 to March 2, 2025.

The prizes for first place, second place, and third place of the onsite final are 10000, 5000, and 3000 USD.

More prizes and detailed information will be announced soon. You can visit International AI Elite Programming Contest for information.

We would like to thank:

The score distribution is as follows: 5001000150015002000(2000+2000)3000(3000+5000)4500.

We hope you enjoy this round. Good luck and have fun!

UPD 1: Editorial

UPD 2: Congratulations to the top 10!

  1. jiangly (Congratulations on being jiangly!!!)
  2. tourist
  3. gamegame
  4. Benq
  5. ecnerwala
  6. arvindf232
  7. ksun48
  8. Egor
  9. potato167
  10. Um_nik (Congratulations on being the only one to solve Problem I!!!)

For the top 50 contestants, we will contact you soon for onsite participation.

Full text and comments »

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

By chromate00, 6 days ago, In English

Hello Codeforces, and the legends of across 999 and more rounds!


wuhudsm, Yugandhar_Master, and I are beyond excited to invite you to Codeforces Round 1000 (Div. 2) at Jan/22/2025 15:05 (Moscow time). Please note the unusual time of the round (2.5 hours before the usual time)!

The contest contains 6 carefully crafted tasks, one of them divided into two subtasks, to be solved in 2 hours. You will solve tasks themed around Little John and his shenanigans aimed towards getting his own dream home (featuring, probably, galvanized square steel).

This round could not exist without the thankful help of these so many people:

The score distribution is as follows.


5001000150022502750(1750+1500)

Before finishing the announcement, I would like to spoil you a little of how the round's story ends.

Little John worked hard, honest and diligent for years, and finally got a home of his dream.

In that sense, I want You to be like Little John in this round.

Hard, honest and diligent will give you the rewards you deserve.


Anyways, that's all for the announcement; Good luck, and have fun!

UPD1: The score distribution has been announced.

Full text and comments »

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

By Proof_by_QED, 8 days ago, In English

Hellowo Codeforces o7

cry, larush, chromate00, LMeyling, Lilypad, and I are ebullient to welcome you to participate in Codeforces Round 998 (Div. 3) at Jan/19/2025 17:35 (Moscow time). We have cooked up 7 problems to be solved in 2 hours and 30 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 of open hacks. After open hacks all accepted solutions will be rejudged on successful hacks.

Note that the penalty for each wrong submission in this round is 10 minutes. Also, note the rule restricting AI use!!! If you are caught using AI in an unorthodox manner, you will be banished off the face of the earth (trust me).

Remember 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)
  • do 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 would like to orz the following individuals for making the contest possible:

UPD: Editorial

Full text and comments »

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

By nifeshe, 6 days ago, In English

Hi, Codeforces!

I'm delighted to invite you to the best/second best/third best round of 2025 so far! Codeforces Round 997 (Div. 2) will be held on Jan/17/2025 17:35 (Moscow time). You will be presented with at least 6 and at most 6 problems, one of which might be divided into two subtasks, and 2 hours to solve them.

Many of you may not believe it, but the problems were authored and written by nifeshe with a great help from maomao90. Moreover, I would like to thank:

The score distribution is as follows: 5001250150020002250(2750+1250).

I hope you will find a non-empty subset of problems to be interesting. Good luck!

UPD 1: Editorial

UPD 2: Congratulations to the top 5!

Div. 1 + 2:

  1. maspy
  2. BurnedChicken
  3. jiangly
  4. antontrygubO_o
  5. Sugar_fan

Div. 2:

  1. OdtreeKing
  2. saaaalty
  3. STUDENT0
  4. rainboy
  5. MamurjonDeveloper

UPD 3: First solves:

A. 00:02:01 by hitonanode

B. 00:02:17 by pipi0818

C. 00:03:52 by Proof_by_QED

D. 00:13:53 by wishgoodluck

E. 00:18:06 by zdc123456

F1. 00:27:48 by peti1234

F2. 00:28:40 by rainboy

Full text and comments »

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

By innocentkitten, 13 days ago, In English

Hello, Codeforces!

I'm pleased to invite you to open up the new year with Codeforces Round 996 (Div. 2) on Jan/12/2025 17:35 (Moscow time)! You will assist Florida Man through his whimsical adventures with 6 tasks in the span of 2 hours. The score distribution is as follows:

                 

50010001500225030003500.

The problems were written and prepared by me, innocentkitten. However, this round would not have been possible without:

We hope you find that the problems are interesting, and that you earn your desired rating gains! or losses, if you somehow want that

UPD 1: The editorial is up! Hope you enjoyed the contest!

UPD 2: Congrats to the top 5!

Div. 1 + 2

  1. Forested

  2. maspy

  3. potato167

  4. A_G

  5. Otomachi_Una

Div. 2

  1. loK10

  2. turgon314

  3. BINYU

  4. dialnote

  5. _Enana

First clears

A. aryan12, 00:00

B. ankan.2526, 00:03 (Div. 1 + 2: arvindf232, 00:03)

C. Sunflower233, 00:11 (Div. 1 + 2: DE_aemmprty, 00:07)

D. suharius, 00:32 (Div. 1 + 2: Survivor_winner, 00:18)

E. myheartwaing, 01:50 (Div. 1 + 2: tute7627, 00:37)

F. N/A (Div. 1 + 2: maspy, 01:04)

Full text and comments »

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

By MikeMirzayanov, 4 weeks ago, In English

Hello, Codeforces!

I'm excited to invite you to participate in MaraTON Challenge 1, our first marathon in collaboration with the TON Foundation. It's great to see our partnership with TON thriving and moving forward.

Take part in the challenge →

The challenge is brought to you by TON blockchain engineers, some of whom are community members. Special thanks to SpyCheese for preparing the problem!

The competition will run for three weeks, starting on Dec/23/2024 16:35 (Moscow time). Get ready to dive deep into the technical details of the blockchain world — it's worth it.

Winners will receive amazing prizes:

  • 1st place: 8,000 USDT
  • 2nd place: 5,000 USDT
  • 3rd place: 3,000 USDT
  • 4th–10th places: 2,000 USDT each
  • 11th–20th places: 1,000 USDT each

Additionally, there will be bonus prizes for the leaders throughout the competition. Starting December 25th and continuing daily until January 13th at 13:35 (UTC), we will award bonus prizes to the top five leaders of the day:

  • 1st place: 250 USDT
  • 2nd place: 125 USDT
  • 3rd place: 75 USDT
  • 4th–5th places: 50 USDT each

Please note that these prizes will be distributed after full testing of all submissions made by 13:35 (UTC) on the respective day. The results are published here: https://mirror.codeforces.com/r/maraton-1-leadership-awards

Join the competition — it's truly something new and exciting on Codeforces!

* All payments will be made to a TON wallet. All payouts (including those for daily leadership) will be issued after the final results are announced.
* In case of ties in the leaderboard, the participant who first achieved the score will rank higher for prize distribution.
* Please note that this is an individual competition. Collaboration, discussing ideas, or using shared code is prohibited. Please adhere to the rules regarding the use of third-party code.

UPD: Here is the link to the table with the current progress on rewards for daily leaders: https://mirror.codeforces.com/r/maraton-1-leadership-awards

Full text and comments »

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

By SoshkinRoman, 4 weeks ago, translation, In English

The Registration for the 48th Petrozavodsk Programming Camp is open.

THE CAMP WILL BE HELD ONLINE from January 28 to February 04, 2025.

For teams from the EAEU, offline participation is possible; details are in the information letter.

Teams of up to 3 members are invited to join

The level of contests: for participants of the semi-finals and finals of the ICPC World Championship

The training Camp schedule consists of 7 contests and 1 day off between them, preliminary schedule: camp.icpc.petrsu.ru/2025w/schedule

For each contest, a problem analysis will be broadcast in English.

The registration fee for participants from the EAEU countries is 10200/18600 rubles per participant (depends on meal inclusion).
The registration fee for participants from other countries is $150 per participant.

To register, the team coach should write a letter to the organizers.
After agreement, each team member must go through individual registration on the site of the Camp.

Contact Information

Full text and comments »

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

By adamant, 2 weeks ago, In English

Hi everyone!

Supported by

We are very happy to announce that Osijek camp is back this Winter, on February 15-23, 2025, right before the 2025 ICPC Europe Championship on February 28 — March 2, 2025. The camp is hosted by the School of Applied Mathematics and Computer Science of the University of Osijek and is brought to you by the organizing team of adamant and -is-this-fft-.

The camp is inspired by various competitive programming camps that we attended during our active years in ICPC, and is aimed to help college students prepare for ICPC regional contests and finals. The camp will consist of 7 ICPC-style contests and 2 days off.

Details

If you're participating in ICPC APAC, or are close to Singapore, please consider the Singapore mirror organized by errorgorn.

After some discussions with participants, and also thanks to the continued support of our sponsors, we decided to reform the structure of participation fees for the camp. While previously, participation fees were 100€ and 150€ per participant for online and onsite participation correspondingly, in this camp the participation fee for both online and onsite participants is 201€ per team.

For a full 3-person team, this marks a 33% reduction in the price of online participation, and a 55% reduction in the price of onsite participation! We hope that it will help us to incentivize onsite participation, and also participation in full teams, to make sure that it is as close as possible to the intended ICPC contest experience for everyone involved.

Note that, similar to previous camp editions, the fee does not include regular meals, travel or accommodation. Some further details about location, travel and food options can be found on the website.

We support and empathize with those affected by the ongoing war in Ukraine, therefore we offer a free participation for affected individuals and teams affiliated with Ukrainian institutions.

The expected starting time for the contests is 10am CET. For online participants, it is still a preferred starting time, but we will make accommodations for virtual participation at a later time, when necessary.

Most of our contests are originally developed for the camp. A small number of contests may be based on previous contests that have not been released to the general public. If you have seen some problems of a contest before, you can't participate on that day. We will privately contact participants who might be affected.

After the camp, we will have a silence period during which camp materials will not be released to the public. We ask participants not to discuss the problems in public unless they obtained an explicit permission from contest authors.

If you would like to get a feel of the contests, you can find links to some of the previously published camp contests here.

Participants

If you are interested in participating, please fill the form here.

We ask you to register before February 8 if you want to participate online and before February 1 if you want to participate onsite. If you require a visa, please register as soon as possible, as it might take a few weeks to receive (depending on location).

Also, if your university or organization has a lively ICPC community that may be interested in attending the camp, and you have some contacts of people in charge (e.g. coaches) we would highly appreciate if you could share some details in a direct message to me. Thanks!

Problemsetters

We'd like to thank and praise the authors of the contests in the camp:

  • Yarema, PetroTarnavskyi, mshcherba — a team from Ivan Franko National University of Lviv, who participated in the 47-th (Luxor, Egypt) and the 48-th (Astana, Kazakhstan) ICPC World Finals.
  • ntherner — Codeforces (ex?)grandmaster, IOI 2024 gold medalist, author of under 15 competitive programming problems.
  • tibinyte2006 — Codeforces newbie, ex-Codeforces pupil, author of over 15 competitive programming problems.
  • AmirrzwM — ICPC 2024 World Finalist, Author of Codeforces Global Round 23 and Rayan Selection Round, Iranian National Olympiad in Informatics (INOI) Silver Medalist.
  • MohammadParsaElahimanesh — Main Author of Codeforces Global Round 23 and Rayan Selection Round, INOI Silver Medalist. Best problem solver on Quera.
  • Halzion — ICPC 2023 world finalist.
  • Claris — ICPC 2017 and 2018 world finalist. Top contributor of QOJ.
  • ToniB — IOI 2023 bronze medal and CERC 2024 first place.
  • ppavic — triple IOI gold medalist.
  • dorijanlendvaj — double IOI gold medalist, Codeforces Legendary Grandmaster.
  • Pyqe — IOI gold medalist, author of IOI 2024 Nile and Tree.
  • Kinon — IMO bronze, silver, and gold medalist.

... And others. We would also like to thank errorgorn and Um_nik for their help with reviewing problem proposals. You can find more details about contest rules and technical setup on the website.

Special thanks

Finally, we say special thanks to

Full text and comments »

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

By I_love_kirill22, 3 weeks ago, translation, In English

Hello to all fans of competitive programming and Codeforces enjoyers! We're happy to invite you to participate in Hello 2025, which will take place on Jan/04/2025 17:35 (Moscow time).

We, I_love_kirill22, dope, and induk_v_tsiane, have prepared 8 problems for you, and you’ll have 2 hours and 30 minutes to solve them. One of the problems is divided into 2 subtasks. The round will be rated for all participants.

Huge thanks to MikeMirzayanov, geranazavr555, and KAN for great systems Polygon and Codeforces!

Special thanks also go to:

Score distribution: 500 — 1000 — 1500 — 2250 — (1000+2000) — 3500 — 3750 — 4500

UPD (Update!) (Update! Yey!) Editorial — link

This round was prepared with the support of T-Generation. If you are a Russian-speaking student, please switch to the Russian version of this blog. There you will find information about our educational projects that may be interesting for you.

UPDATE

Congratulations to the winners:

  1. jiangly

  2. ksun48

  3. ugly2333

  4. Flamire

  5. Ormlis

  6. hos.lyric

  7. ecnerwala

  8. noimi

  9. maspy

  10. arvindf232

Full text and comments »

Announcement of Hello 2025
  • Vote: I like it
  • +435
  • Vote: I do not like it


×
Can't find such blog