By geranazavr555, 3 years ago, In English

Hello!

The most problems on Codeforces are "classic input-output" problems in which you have to write an entire program: read the input and write the answer. Also, there are "interactive" problems in which you have to interact with a jury's program. But Codeforces supports some other types of problems: problems with graders and output-only problems.

You can test an output-only problem and a problem with grader in this mashup.

Problems with graders

In such problems, you (a participant) have to implement not the entire program but only some interface or function described in the problem's statement. For example. you may be asked to implement function f(a: int, b: int, c: int) -> int in Python or int f(int a, int b, int c) in C++. Only Python and C++ are supported for now for such problems.

For problem writers: read this post and this post to learn how to create a problem with a grader. The example problem with a grader is already shared with all Polygon users.

Output-only problems

In such problems, you (participant) have to send only a zip-file with outputs on each test (or only on a subset of tests). The structure of the zip file must be following:

archive-name.zip
|
|- 01.out
|
|- 02.out
|
|- 03.out
...

I.e. zip-file must contain text files with the outputs named like <2-digits-test-index>.out.

Commonly, each problem could be marked as output-only, but it's recommended to publish tests using the "Problem materials" section in Polygon (see this post to learn more).

Full text and comments »

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

By FairyWinx, 3 years ago, translation, In English

Привки, Кодефорсес (ノ◕ヮ◕)ノ*:・゚✧

(Hello, Codeforces on Russian)

Igorbunov and I are happy to invite you to participate in Codeforces Round 777 (Div. 2), all the tasks of which will be about a little girl Madoka. It will take place on Mar/11/2022 17:35 (Moscow time). The round will be rated for all participants with rating strictly lower than 2100. You will have 2 hours to solve 6 problems.

I would also like to express my gratitude to the following people:

I wish you high rating, and I also hope that I will help you to distract from bad news at least a little ( ❤ ω ❤ )

Scoring distribution: 500 — 1250 — 1500 — 2000 —2500 — 3000

UPD1: Editorial

UPD2: Congratulations to the contest winners

Div 1+2

1 jqdai0815 9457
2 Geothermal 9219
3 rainboy 8649
4 End. 8529
5 kshitij_sodani 8250

Div 2

1 shnirelman 6955
2 zzfzzfzzfzzf 6558
3 Kaname-Madoka 6539
4 peuch 6317
5 SnowySummer 6301

Full text and comments »

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

By awoo, history, 3 years ago, translation, In English

Hello Codeforces!

On Mar/10/2022 17:35 (Moscow time) Educational Codeforces Round 124 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated 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 given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Full text and comments »

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

By Vladosiya, history, 3 years ago, translation, In English

Hello! Codeforces Round 776 (Div. 3) will start at Mar/08/2022 17:35 (Moscow time). You will be offered 7-8 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have a rating of 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-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.

You will be given 7-8 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

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 point of 1900 or higher in the rating. 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.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of our work. Problems have been created and written by ITMO University teams: MikeMirzayanov, MisterGu, myav, Gol_D, Aris, KwisatzCoderach, me Vladosiya.

Also many thanks to mango_lassi, espr1t, karemo, starboy_jb, Fly_37, omikad, Katya_Goryachkina, Omja, I_love_kirill22, oversolver, Jostic11, yorky, _4dr_ and doreshnikov for testing the contest and valuable feedback.

Good luck!

UPD: Congratulations girls on International Women's Day <3.

UPD 2: Editorial

Full text and comments »

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

By ch_egor, 3 years ago, translation, In English

Hello!

Right now happens the first tour of the Open Olympiad in Informatics, and tomorrow will be the second one. This contest is prepared by Moscow Olympiad Scientific Committee that you may know by Moscow Team Olympiad, Moscow Olympiad for Young Students and Metropolises Olympiad (rounds 327, 342, 345, 376, 401, 433, 441, 466, 469, 507, 516, 541, 545, 567, 583, 594, 622, 626, 657, 680, 704, 707, 727, 751).

Open Olympiad consists of the most interesting and hard problems that are proposed by a wide community of authors, so we decided to conduct a Codeforces regular round based on it, which will happen on Mar/06/2022 12:55 (Moscow time) and will be based on both days of the Olympiad. Each division will have 6 problems and 2 hours to solve them.

We kindly ask all the community members that are going to participate in the competition to show sportsmanship by not trying to cheat in any manner, in particular, by trying to figure out problem statements from the onsite participants. If you end up knowing some of the problems of Moscow Open Olympiad (by participating in it, from some of the onsite contestants or in any other way), please do not participate in the round. We also ask onsite contestants to not discuss problems in public. Failure to comply with any of the rules above may result in a disqualification.

Problems of this competition were prepared by cookiedoth, shishyando, gmusya, Tikhon228, ligaydima, Siberian, isaf27, I_love_myself, talant, KiKoS, _overrated_ guided by cdkrot, vintage_Vlad_Makeev, GlebsHP, Zlobober, meshanya, ch_egor, grphil, voidmax, dyrbulshchyl, Endagorion and Helen Andreeva.

Thanks to DmitryGrigorev and KAN for the round coordination, statement translation and preparation of problems for the second division, and also thanks for MikeMirzayanov for systems Codeforces and Polygon, which was used to prepare problems of this olympiad.

Also thanks to low_ and Jeffrey for providing an additional problems that helped to create (I hope) a balanced problem set for the round.

Good luck everybody!

Due to the official competition source codes of other participants will not be available for an hour after the end of the round.

UPD1: Winners!

Div. 1:

  1. jiangly
  2. QuietBeautifulThoughts
  3. maroonrk
  4. 137_345_2814
  5. Elegia

Div. 2:

  1. AC464
  2. Nephry
  3. andyzys
  4. Let_Us_Rebegin
  5. _JacderZhang_

UPD2: Editorial

Full text and comments »

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

By MateoCV, history, 3 years ago, In English

Hola Codeforces!

I am happy to invite you to Codeforces Round 774 (Div. 2), which will take place on 04.03.2022 18:35 (Московское время). Notice the unusual time! The round will be rated for participants with rating lower than 2100. You will have 2 hours to solve 6 problems. The problems were authored and prepared by me.

I would like to thank the following people who made the round possible:

See you in the standings!

UPD:

Scoring distribution: $$$750$$$ — $$$1000$$$ — $$$1250$$$ — $$$2000$$$ — $$$2500$$$ — $$$3000$$$

Thanks to competitive__programmer, video editorials for some of the problems will be available on his channel after the round.

UPD: Editorial

UPD: Congratulations to the winners!

Official winners:

  1. lydia1
  2. mjhmjh1104
  3. Turret
  4. Vsinger_MoQingxian
  5. WAduck
  6. woolim
  7. Iam1789
  8. yagoo
  9. Koba.rde
  10. dtc03012

Unofficial winners:

  1. Vercingetorix
  2. Um_nik
  3. hank55663
  4. mir
  5. dlalswp25
  6. disorientation
  7. rainboy

Full text and comments »

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

By geranazavr555, 3 years ago, translation, In English

Hello, Codeforces.

In this post, I'll share with you a few recent improvements in Polygon made by MikeMirzayanov, unreal.eugene, DK318 and me.

Polygon is a service to prepares programming problems and contests. It is usually used to prepare problems for olympiads/programming contests but it is also often used to prepare educational content. It is located at https://polygon.codeforces.com/ and is open to everybody.

Here are three recent new features:

  • IOI-like Graders for Python
  • Problem Materials
  • User Groups

Full text and comments »

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

By george_stelian, 3 years ago, In English

Hi Codeforces,

I am honored to present you "Adolescent Grigore Moisil" (AGM) International Programming Contest (8th edition).

AGM is addressed to high school students who can form teams of up to 3 members, ICPC style. The contest has a qualification round on 6th March 2022 at 13:00 GMT. The problems are set up fully by (former) university students.

We are looking forward to international participants. Both the qualification and final round will be held online due to the pandemic situation. You can register here until 5th March 2022 at 13:00 GMT.

Besides diplomas for the first 10 teams in the final round, the first team will receive a prize of 1200 RON, the second team a prize of 900 RON, and the third team a prize of 600 RON.

Finally, I am more than delighted to present you our team: patrick.sava (the heart of the project), average_frog_enjoyer, munteanuvlad98, Stelutzu, Alex18mai, teoionescu, carabet.cosmin, Stefan_Radu, Mihai22e, vreaudelftpls, GinguIonut, caesar2001, georgerapeanu, MiricaMatei, popovicirobert, tinca_matei, Usu and me.

Take a look at our problem-sets from the last edition:

Qualification

Final Round Day1

Final Round Day2

Our website

AGM Facebook

Registration Link

Also, don't hesitate to contact us: [email protected]

Thank you very much,

George

Full text and comments »

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