Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

isaf27's blog

By isaf27, history, 4 months ago, In English

Hello Codeforces!

I want to invite you to participate in the Stage 5: Moscow of the 3rd Universal Cup. It will be held this Saturday, on July 27, 2024. The contest uses the problemset of competition from HSE Techarena Training Camp 2024 which took place June 30, 2024.

Problem authors are: isaf27, grphil, ashmelev, Kirundel, dmkz, Microscopic_Dankakon, elena.

Proceed to the Universal Cup site to take part!

About Universal Cup

Full text and comments »

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

By isaf27, history, 3 years ago, In English
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...

Full text and comments »

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

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

Hi all!

This weekend, at Nov/14/2021 09:05 (Moscow time) we will hold Codeforces Round 755 (Div. 1, based on Technocup 2022 Elimination Round 2) and Codeforces Round 755 (Div. 2, based on Technocup 2022 Elimination Round 2). They are based on problems of Technocup 2022 Elimination Round 2 that will be held at the same time.

Technocup is a major olympiad for Russian-speaking high-school students, so if you fall into this category, please register at Technocup website and take part in the Elimination Round.

Div. 1 and Div.2 editions are open and rated for everyone. Register and enjoy the contests!

Have fun!

The scoring distribution:

  • Technocup: 500 — 500 — 1000 — 1500 — 2000 — 2500 — 3250
  • Div1: 500 — 1000 — 1500 — 2000 — 2750 — 3750
  • Div2: 500 — 500 — 1000 — 1500 — 2000 — 2500

The round is over. Congratulations to the winners:

Technocup

  1. Artyom123
  2. turmax
  3. Kirill22
  4. jiangbowen_
  5. Kapt

Div1

  1. ko_osaga
  2. maroonrk
  3. xay5421
  4. jiangly
  5. uwi

Div2

  1. 1443356159
  2. int65536
  3. strongerthanspeed
  4. DSair
  5. nunu03

Editorial

Full text and comments »

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

By isaf27, history, 4 years ago, In English

Hello, Codeforces!

grakn

I'm glad to invite you to Grakn Forces 2020, which will be held on Sep/30/2020 17:35 (Moscow time). It will be combined rated round for both divisions.

This round is initiated and supported by Grakn Labs. More information you could find here.

All problems were authored and prepared by 300iq and isaf27. Thanks to coderz189, Retired_cherry, QAQAutoMaton, Prakash11, morzer, qlf9, nkamzabek, gdb_18, talibmohd, Dragnoid99, KAN and VladGanzha for testing problems and good advice. Thanks to MikeMirzayanov for great systems Codeforces and Polygon.

You will be given 9 problems and 2 hours 30 minutes to solve them. Please, read all the problems. Good luck, have fun and we wish everyone high ratings!

Thanks to Grakn Labs for the gifts to the participants:

Prizes:

  • 1st place = 500 euros
  • 2nd place = 250 euros
  • 3rd place = 100 euros

Additional Prizes:

Top 50 receive:

Grakn Labs swag pack:

  • Stickers
  • Grakn Labs t-shirt

Random 50 from 51-250 receive:

Grakn Labs swag pack:

  • Stickers
  • Grakn Labs t-shirt

Grakn Labs is a team of people driven by a purpose: to solve the world's most complex problems, through knowledge engineering. They are the inventors of the Grakn knowledge graph and the Graql query language. Their technology helps organizations in various industries, including Life Sciences, Defence & Security, Financial Services, and Robotics, to build intelligent systems that will change the world.

Grakn Labs looking for the best to round out their team, if you think this sounds like an interesting chance to work on an innovative technology; they'd love to hear from you.

FILL OUT FORM →

UPD! Scoring distribution: 500 — 1000 — 1250 — 2000 — 2500 — 2500 — 3000 — 3750 — 3750

UPD! Editorial

Congratulations to winners:

  1. tourist
  2. Benq
  3. maroonrk
  4. Egor
  5. ecnerwala

Full text and comments »

Announcement of Grakn Forces 2020
  • Vote: I like it
  • +506
  • Vote: I do not like it

By isaf27, history, 5 years ago, In English

Hello Codeforces.

I'm writing this post to make comments about a situation on the last Codeforces Round and tell the bad news. We did many mistakes and due to them, the round caused much dissatisfaction from the Codeforces community.

Some of our mistakes:

  1. Some stupid mistakes in the statements.

  2. In the problem D2E/D1C the numbers $$$d_i$$$ were not necessarily sorted, but there were no pretests for that.

  3. The checker of the problem D2F/D1D didn't check one of the requirements and due to that $$$8$$$ solutions failed on pretests during the system testing.

  4. After the editorial was posted the mistake was found in the main solution of the problem D1E (more details here). Now we don't know the correct solution.

So, the round was very unsuccessful, I'm very sorry about this. I will make conclusions and will try to avoid such situations later. Please, treat with respect to the authors, even in such a bad situation, a big work was done and I hope you enjoyed the problems.

Now about the bad news: due to the wrong checker and the wrong solution, we decided to make Div1 round unrated, Div2 round is still rated, Sorry for all, who had a big positive rating change.

Also, we are making a D1E problem-solving challenge: if you have an algorithm, that can be proven, please share your approach.

So, that was all news, sorry again,

Ivan.

P.S.

If you are angry now, you can use this post to set a dislike, please don't dislike an announcement/editorial.

Full text and comments »

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

By isaf27, history, 5 years ago, In English

The problems A, C, D, G are authored and prepared by isaf27.

The problems B, E, F are authored and prepared by 300iq.

Tutorial is loading...

Jury solution: link

Tutorial is loading...

Jury solution: link

Tutorial is loading...

Jury solution: link

Tutorial is loading...

Jury solution: link

Tutorial is loading...

Jury solution: link

Tutorial is loading...

Jury solution: link

Tutorial is loading...

Jury solution: link

Let's discuss your ideas and solutions in the comments. Thanks for your participation!

Full text and comments »

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

By isaf27, 6 years ago, translation, In English
Tutorial is loading...

Jury solution: 54047380

Tutorial is loading...
Jury solution: 54047416
Tutorial is loading...
Jury solution: 54047456
Tutorial is loading...
Jury solution: 54047487
Tutorial is loading...
Jury solution: 54047513
Tutorial is loading...
Jury solution: 54047561
Tutorial is loading...
Jury solution: 54047626
Tutorial is loading...
Jury solution: 54047665

Full text and comments »

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

By isaf27, 6 years ago, translation, In English

Hello, Codeforces!

I'm glad to invite you to Codeforces Round 559 (Div. 1) and Codeforces Round 559 (Div. 2), which will be held on May/12/2019 17:35 (Moscow time). The round will be rated for both divisions (I hope).

All problems were written and prepared by me. Thanks to Aleks5d, TLE, sunset, Sulfox, peltorator for testing problems and good advice, 300iq for round coordination and help with preparation and MikeMirzayanov for great systems Codeforces and Polygon.

You will be given 6 problems in both divisions and 2 hours to solve them. Please, read all the problems. Good luck, have fun and I wish everyone high ratings!

The scoring distribution will be announced closer to the beginning of the round.

UPD

The contest finished, contgratulations to the winners:

Div1:

  1. mnbvmar
  2. ecnerwala
  3. ainta
  4. ksun48
  5. ekzhang

Div2:

  1. hbi1998
  2. Nutella3000
  3. calabash_fool
  4. ahgus89
  5. 1207koo

Editorial

Full text and comments »

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

By isaf27, history, 6 years ago, In English

Hello everyone!

I would like to invite you to participate in HackerEarth December Circuits '18. It's a long contest that will start on December 21, 21:00 IST (check your timezone). The contest will run for 9 days.

The participants will be challenged with 7 traditional algorithmic tasks of varying difficulty levels and 1 approximate problem for a duration of 9 days. For traditional algorithmic tasks, you will receive points for every test case your solution passes — so you can get some points with partial solutions as well. For the approximation task, your score depends on the best solution in the contest so far. Here is the detailed timeline of the challenge,

  • Day — 0 Problem 1, Problem 2, Problem 3 (Approximate)
  • Day — 1 Problem 4, Problem 5
  • Day — 4 Problem 6, Problem 7
  • Day — 6 Problem 8
  • Day — 9 Challenge ends

As usual, there will be some nice prizes for the top five competitors:

  1. $100 Amazon gift card + HE t-shirt.
  2. $75 Amazon gift card + HE t-shirt.
  3. $50 Amazon gift card + HE t-shirt.
  4. HE t-shirt.
  5. HE t-shirt.

I am the tester of all the problems. I'd like to thank the problem setters Sanjay Gidwani (sanjaygidwani), Mohd Salik (abx_2109), Orap Andrew (Dalgerok), Saurabh Joshi (Apptica) and Anand Jaisingh (MazzForces).

The contest will be RATED.

Happy Coding :)

Full text and comments »

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

By isaf27, history, 6 years ago, translation, In English

Problems A-G have been created by isaf27. The idea of the problem A has been offered by peltorator.

The problem H has been created by cdkrot.

Tutorial is loading...

Jury's solution: 44522356

Tutorial is loading...
Jury's solution: 44522430
Tutorial is loading...
Jury's solution: 44522470
Tutorial is loading...
Jury's solution: 44522488
Tutorial is loading...
Jury's solution: 44522506
Tutorial is loading...
Jury's solution: 44522527
Tutorial is loading...
Jury's solution: 44522542

Solution by Endagorion: 44519413 (maximal spanning tree)

Tutorial is loading...
Jury's solution: 44522571

Full text and comments »

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

By isaf27, 6 years ago, translation, In English

Hi all!

I'm happy to welcome you at the Div.1 and Div.2 shared rated round Mail.Ru Cup 2018 Round 1, it will start at Oct/18/2018 19:35 (Moscow time). The problems were prepared by me — Ivan Safonov. I'd like to thank Dmitry cdkrot Sayutin for an idea and preparation of one of the problems and Egor peltorator Gorbachev for an idea for another one.

This round is the first round if the new championship called Mail.Ru Cup, you can learn more about it following the link. The round will be rated for everybody!

The championship feature the following prizes:

  • First place — Apple MacBook Air
  • Second and third place — Apple iPad
  • Fourth, fifth, sixth places — Samsung Gear S3
  • Traditionally, the top 100 championship participants will get cool T-shirts!

In each round, top 100 participants get prize points according to the table. The championship's result of a participant is the sum of the two largest results he gets on the three rounds.

Huge thanks to Grigory vintage_Vlad_Makeev Reznikov and Ilya izban Zban for testing the problems, to Nikolay KAN Kalinin and Ildar 300iq Gainullin for their help in preparation, and to Mike MikeMirzayanov Mirzayanov for Codeforces and Polygon platforms.

The round will feature eight problems to solve in two and a half hours. The scoring will be announced closer to the beginning of the round.

I hope everyone will find some problems interesting. I wish everybody a successful round and a positive rating change!

Good luck!

UPD1,Scoring distribution:

500 750 1250 1500 2000 2250 3000 4000

Congratulations to the winners of Round 1!

  1. mnbvmar
  2. Um_nik
  3. V--o_o--V
  4. LHiC
  5. Lewin

UPD2

Editorial

Full text and comments »

Announcement of Mail.Ru Cup 2018 Round 1
  • Vote: I like it
  • +241
  • Vote: I do not like it

By isaf27, history, 6 years ago, In English

Hello CodeForces Community! Once again we bring to you a fresh set of programming challenges with the June Lunchtime 2018, a three-hour contest of your coding abilities. Hope to see you all join us and challenge for the top spot!. Joining me this time on the problem setting panel are:

  • Problem Setter: isaf27 (Ivan Safonov)
  • Problem Tester: kingofnumbers (Hasan Jaddouh)
  • Editorialist: likecs (Bhuvnesh Jain)
  • Admin: kingofnumbers (Hasan Jaddouh)
  • Statement Verifier: Xellos (Jakub Safin)
  • Russian Translator: CherryTree (Sergey Kulik
  • Mandarin Translator: huzecong (Hu Zecong)
  • Vietnamese Translator: (VNOI Team)

Contest Details:

Time: 30th June 2018 (1930 hrs) to 30th June 2018 (2230 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone
Contest link: https://www.codechef.com/LTIME61 Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate. Prizes: Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://discuss.codechef.com/questions/51999/how-do-i-win-a-codechef-goodie
(For those who have not yet got their previous winning, please send an email to winners@codechef.com) Good Luck!
Hope to see you participating!!
Happy Programming!!

Full text and comments »

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