flamestorm's blog

By flamestorm, 3 weeks ago, In English

Thank you for participating in our contest! We hope you enjoyed it.

Please let us know what you thought of the problems by voting!

1952A - Are You a Robot, Again?

Idea: flamestorm

Hint
Solution
Feedback

1952B - Is it stated?

Idea: willy108

Hint
Solution
Feedback

1952C - They Have Fooled

Idea: AlperenT

Hint 1
Hint 2
Hint 3
Solution
Feedback

1952D - Are You a Procrastinator?

Idea: AlperenT

Hint 1
Hint 2
Hint 3
Solution
Feedback

1952E - Sweep Line

Idea: AlperenT

Hint 1
Hint 2
Hint 3
Hint 4
Hint 5
Hint 6
Solution
Feedback

1952F - Grid

Idea: flamestorm

Hint 1
Hint 2
Solution
Feedback

1952G - Mathematician Takeover

Idea: flamestorm

Hint 1
Hint 2
Solution
Feedback

1952H - Palindrome

Idea: ToxicPie9

Hint 1
Hint 2
Solution
Feedback

1952I - Dark Matter

Idea: ToxicPie9

Hint
Solution
Feedback

1952J - Help, what does it mean to be "Based"

Idea: ToxicPie9

Solution
Feedback

Full text and comments »

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

By flamestorm, 4 weeks ago, In English

We hope you enjoyed the contest!

1950A - Stair, Peak, or Neither?

Idea: SlavicG

Tutorial
Solution

1950B - Upscaling

Idea: flamestorm

Tutorial
Solution

1950C - Clock Conversion

Idea: mesanu

Tutorial
Solution

1950D - Product of Binary Decimals

Idea: flamestorm

Tutorial
Solution

1950E - Nearly Shortest Repeating Substring

Idea: mesanu

Tutorial
Solution

1950F - 0, 1, 2, Tree!

Idea: flamestorm

Tutorial
Solution

1950G - Shuffling Songs

Idea: SlavicG

Tutorial
Solution

Full text and comments »

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

By flamestorm, 4 weeks ago, In English

Hej, Codeforces!

mesanu, SlavicG and I are very excited to invite you to Codeforces Round 937 (Div. 4)! It starts on Mar/28/2024 17:45 (Moscow time).

The format of the event will be identical to Div. 3 rounds:

  • 5-8 tasks;
  • ICPC rules with a penalty of 10 minutes for an incorrect submission;
  • 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
  • after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated
  • by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer).

We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants.

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behavior. To qualify as a trusted participant of the fourth 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 1400 or higher in the rating.

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.

Thanks a lot to the testers: erekle, vladmart, nskybytskyi, Vladosiya, KrowSavcik, Dominater069, LucaLucaM, MADE_IN_HEAVEN, tvladm, nor.

We suggest reading all of the problems and hope you will find them interesting. Good luck!

UPD: The round is delayed by 10 minutes: https://mirror.codeforces.com/blog/entry/127616?#comment-1133556.

UPD: The editorial is posted!

Full text and comments »

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

By flamestorm, 2 months ago, In English

mesanu, SlavicG and I are very excited to invite you to Codeforces Round 928 (Div. 4)! It starts on 19.02.2024 17:35 (Московское время). We would also like to give a very special thanks to the efforts of MikeMirzayanov and Vladosiya, who helped significantly with the preparation of the round!

The format of the event will be identical to Div. 3 rounds:

  • 5-8 tasks;
  • ICPC rules with a penalty of 10 minutes for an incorrect submission;
  • 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
  • after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated
  • by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer).

We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants.

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behavior. To qualify as a trusted participant of the fourth 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 1400 or higher in the rating.

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.

Thanks a lot to the testers: MADE_IN_HEAVEN, Gheal, Dominater069, Phantom_Performer, Vladosiya, htetgm, hbarp, tvladm!

We suggest reading all of the problems and hope you will find them interesting. Good luck!

UPD: Editorial is posted!

Full text and comments »

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

By flamestorm, 4 months ago, In English

We hope you enjoyed the contest!

1915A - Odd One Out

Idea: flamestorm

Tutorial
Solution

1915B - Not Quite Latin Square

Idea: flamestorm

Tutorial
Solution

1915C - Can I Square?

Idea: SlavicG

Tutorial
Solution

1915D - Unnatural Language Processing

Idea: flamestorm

Tutorial
Solution

1915E - Romantic Glasses

Idea: flamestorm

Tutorial
Solution

1915F - Greetings

Idea: mesanu

Tutorial
Solution

1915G - Bicycles

Idea: SlavicG

Tutorial
Solution

Full text and comments »

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

By flamestorm, 7 months ago, In English

In 1873F - Money Trees in the statement it is written:

  • ...choose a contiguous subarray of the array $$$[h_l, \dots, h_r]$$$ such that for each $$$i$$$ ($$$l \leq i < r$$$), $$$h_i$$$ is divisible by $$$h_{i+1}$$$....

We received many clarifications from many people of the form "if $$$l \leq i < r$$$, then $$$l < r$$$, so how can $$$l=r$$$ in the sample?" Since this is an important concept, I just wanted to explain it in a bit more detail here.

First thing to note: the statement $$$l \leq i < r$$$ is not a constraint on $$$l$$$ and $$$r$$$. The only constraints on $$$l$$$ are $$$r$$$ will be written in the input section. $$$l \leq i < r$$$ is just so we can establish the values of $$$i$$$ for which we care about the divisibility condition.

Think of it like this: this is equivalent to the for loop below.

for (int i = l; i < r; i++) {
    // check h[i] divisible by h[i + 1]
}

In particular, what will happen if $$$l = r$$$? The for loop will simply not run, meaning that if $$$l=r$$$ there is nothing to check, so the statement is vacuously true, and so any subarray of size one satisfies the divisibility condition (there is another condition that we need to satisfy, but that's besides the point).

Consider another example: suppose we said we want to find the longest subarray so that all elements of the subarray are equal. More formally, this can be written as: for each $$$i$$$ ($$$l \leq i < r$$$) we need $$$a_i = a_{i+1}$$$. For instance, the answer for $$$[1,2,3,3]$$$ is the subarray with $$$l=3,r=4$$$. What's the answer for array $$$[1,2,3]$$$? It should be any array of length one, because in an array of length one the only element is of course equal to itself.

So this is why we usually take vacuous truth! Since there is nothing to prove, we say it is true.

Full text and comments »

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

By flamestorm, 12 months ago, In English

We hope you enjoyed the contest!

1829A - Love Story

Idea: SlavicG

Tutorial
Solution

1829B - Blank Space

Idea: mesanu

Tutorial
Solution

1829C - Mr. Perfectly Fine

Idea: SlavicG

Tutorial
Solution

1829D - Gold Rush

Idea: flamestorm

Tutorial
Solution

1829E - The Lakes

Idea: mesanu

Tutorial
Solution

1829F - Forever Winter

Idea: flamestorm

Tutorial
Solution

1829G - Hits Different

Idea: flamestorm

Tutorial
Solution

1829H - Don't Blame Me

Idea: SlavicG

Tutorial
Solution

Full text and comments »

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

By flamestorm, 13 months ago, In English

Hello, Codeforces!

I, along with AlperenT, Ari, BucketPotato, ScarletS, and ToxicPie9, would like to invite everyone on Codeforces to the April Fools Day Contest 2023! The 11th April Fools Day Contest will take place on Apr/01/2023 17:35 (Moscow time). This is a joke competition in which solving the problem is often easier than figuring out what the actual task is.

Please note that the round is unrated.

In this round you'll be given $$$n$$$ weird problems and 2 hours to solve them, where $$$7 \leq n \leq 12$$$. At most $$$\sqrt{n}$$$ of the problems will be interactive. The contest will use ACM ICPC rules (no hacks, the standings are decided by the number of solved problems and penalty time earned on them).

You can submit solutions in any language allowed by Codeforces, unless the problem says otherwise. To get an idea of what the contest will look like, you can check out the contests of the past years: 2012, 2013, 2014, 2016, 2017, 2018, 2019, 2020, 2021, 2022.

Good luck, and have fun!

UPD1: Thanks willy108 for testing!

UPD2: The editorial is released!

UPD3: Congrats to the winners!

  1. InternetPerson10
  2. Geothermal
  3. A_G
  4. Maksim1744
  5. LJC00118

And congrats to the first solvers!

UPD4: Sorry for the inconvenience, the contest is now open for practice submissions + virtuals.

Full text and comments »

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

By flamestorm, 14 months ago, In English

As you may have seen, I've written a lot of problems.

In this post, I want to go over each of my problems and describe my thought process for how I created each problem. I got this idea from antontrygubO_o, but I was also inspired by McDic's editorials that included a "behind story" for each problem. Anyway, I thought it would be fun to give you all a glimpse into my thought process: where my ideas came from, the obstacles I encountered along the way, and any random tidbits that give a bit more pizzazz to the problems.

I think it's important to remember that problem-writing is a creative endeavor, so I hope you'll enjoy reading about the making of my problems as much as I enjoyed creating them. And who knows, maybe you'll even be inspired to write some problems of your own.

Also, spoilers for a lot of problems. Obviously.

ID Problem Rating Contest Comment
001 Domino Disaster 800 Codeforces Round #742 The first problem I ever wrote. I'm firmly in the camp that thinks Div. 2A problems should be more implementation-based rather than random constructions or math formulas, and this is the perfect type of problem to embody that spirit, I think. Easy enough for basically everyone to try and solve.
002 MEXor Mixup 1000 Codeforces Round #742 Actually, this was the first B problem I had seen involving the idea of "precompute answers between test cases", and it seemed to trip a few people up (including LGMs!). Luckily, I was aware of the idea when later problems with similar ideas came around.
003 Carrying Conundrum 1600 Codeforces Round #742 A nice idea, I think, but I wish I would've made the "answer extraction" a little cleaner.
004 Expression Evaluation Error 2000 Codeforces Round #742 This problem was originally proposed as C (and in my opinion, is easier than the above problem). If you want a free 2000, I recommend you do this problem.
005 One-Four Overload 2700 Codeforces Round #742 The first of my "sufficient = necessary" problems.
006 Chef and Pairwise Distances 2012 September Cook-Off 2021 Geometry problem, yay! And it's also the archetype of "large inputs fail".
007 Ones Guessing N/A Codechef SnackDown 2021 Final Round To say the least, I was quite thrilled to see my third contest problem be in Codechef SnackDown finals. It's a funny problem too. Something to think about: how can we write the interactor for this problem to fail every solution except the intended one?
008 Not Shading 800 Codeforces Round #766 Well it looks like I broke my rule about hard/stupid constructive D2A. In my defense, however, I proposed this as D2B, and it was moved down (because the original D2A proposal was... worse, let's just say).
009 Not Splitting 2700 Codeforces Round #766 I think this problem is quite easy, to be honest (I proposed it at E), but perhaps scary geometry terms threw people off. Or maybe it was slightly wrong but technically correct statement at the beginning of contest (because translators changed it like 10 minutes before). Oops.
010 Mango Market 2393 February Cook-Off 2022 Quite goofy problem. I thought of it while studying for an economics exam, hence the flavourtext (the original name was "Monopsonistic Market").
011 Magnet Sort 1804 February Lunchtime 2022 I don't know how to say it, but this is the most generic ad-hoc problem I've ever seen. Yes, that's an oxymoron.
012 Colorful Stamp 1100 Codeforces Round #784 And here come the Div. 4 problems! To be honest, I think it is quite hard to make a Div. 4D, because we're past the "just implement" problems, but it still needs to be easy... I think this problem is too hard for that slot, but somehow it managed to only be 1100.
013 Minimum Crossings (Easy Version) and Minimum Crossings (Hard Version) 1400/1500 Codeforces Round #790 Back when Div. 4 final problem was just "use standard idea". I somewhat regret putting harder version, but I'm a sucker for subtasks.
014 Where's the Bishop? 800 Codeforces Round #799 A simple but natural implementation problem. I'm happy with it.
015 Binary Deque 1200 Codeforces Round #799 Though process behind this problem: "wouldn't it be funny if we had deque in Div. 4?"
016 3SUM 1300 Codeforces Round #799 Very natural and nice problem, and perfect for Div. 4. I like it.
017 2^Sort 1400 Codeforces Round #799 Very unnatural and ugly problem, and not perfect for Div. 4. I still like it.
018 XOR Mixup 800 Codeforces Round #803 Ok so maybe I set goofy problems at D2A. In my defense, you literally can't get this one wrong. By the way, the déjà vu theme of this contest comes from the fact that the titles of each of these problems is a reference to some previous contest, which I don't think anyone saw (except Ari). This one's a reference to MEXor Mixup.
019 Rising Sand 800 Codeforces Round #803 This problem definitely exists, and is a reference to Falling Sand.
020 3SUM Closure 1300 Codeforces Round #803 This problem was added very late to the contest (like, literally, two days before), so unfortunately there were many FSTs because a lot of people used some casework bash(. Testers thought that problem D (which was originally C) was too hard, but I didn't think so. I think I would've been happier with the round without this problem, but hindsight is 20/20. A reference to 3SUM.
021 Fixed Point Guessing 1600 Codeforces Round #803 This would've been a really nice C, I think, but now it's just an easy D. Oh well. The idea is still cute. A reference to Fixed Point Removal.
022 PermutationForces II 2300 Codeforces Round #803 This version of the problem is essentially due to errorgorn, because my original version just had some easy cheese. Also, I don't know why it's 2300, I was worried it was too easy for E. A reference to PermutationForces, obviously.
023 Equal Reversal 2800 Codeforces Round #803 *The best problem I've made.* A surpising result where the obvious necessary condition is not in fact sufficient, and you have to think for a bit more what to do. I originally proposed it at D. Oops. I guess I was warned.
024 Long Binary String 2900 Codeforces Round #803 This problem definitely is one of the problems of all time. Some might call it a knowledge check, but I call it a skill issue. A (very oblique) reference to Long Colorful Strip.
025 YES or YES? 800 Codeforces Round #806 I didn't know what YES or YES was, until I saw it on one of v_Enhance's handouts. I still don't get K-Pop.
026 ICPC Balloons 800 Codeforces Round #806 The only way to make a goofy implementation problem is to write one about the king of goofy implementation problems themselves.
027 Yet Another Problem About Pairs Satisfying an Inequality 1300 Codeforces Round #806 I tried to make a problem with a title longer than the statement. I got close.
028 Colourblindness 800 Codeforces Round #817 I legitimately don't remember making this problem.
029 Word Game 800 Codeforces Round #817 Inspired by Scattergories, of course.
030 Line 1100 Codeforces Round #817 Some random goofy greedy problem to fill in the slot.
031 Seven-Segment Factoring 2675 Starters 59 A nice problem, because it looks super strange but you can get incremental observations that slowly make it more and more approachable. I wish there were subtasks. Sadly, since it was used in a Starters contest, barely anyone saw it(.
032 Sum 800 Codeforces Round #827 uh
033 Stripes 900 Codeforces Round #827 Div. 4C speedbump! More like a brake check actually...
034 Medium Number 800 Codeforces Round #835 ok i literally cannot provide meaningful commentary for D4A
035 Quests 1500 Codeforces Round #835 Another problem made backwards. I was wondering, "we have too many binary search on array problems in Div. 4, but no binary search on the answer..."
036 SSeeeeiinngg DDoouubbllee 800 Codeforces Round #836 Ok I have no excuse for this, but at least this is easier than "here is random formula that trivializes".
037 Almost All Multiples 1400 Codeforces Round #836 A random problem I came up with a few days before the contest to split the constructive problems up. It ended up being basically constructive. Darn.
038 Tick, Tock 2500 Codeforces Round #836 Blame manish.17 for the flavortext. Also, I'm not sure why this is 2500 either, because I originally proposed it at D. Oops.
039 Decent Division 3000 Codeforces Round #836 Cowritten with manish.17; I proposed an easier version where the ratio of ones to zeroes is between $$$0.5$$$ and $$$2$$$. Apparently the same solution could be adapted to this harder version. Somehow, it's the hardest problem I wrote, even though I wrote a harder problem that had to be removed from the contest because we found it elsewhere(.
040 Codeforces Checking 800 Codeforces Round #849 insert witty remark here
041 Following Directions 800 Codeforces Round #849 I'm quite happy with the double entendre of the problem title. The problem itself is a thing that exists.
042 Prepend and Append 800 Codeforces Round #849 I actually like the idea of having concepts like two pointers being given in these implementation problems.
043 Range Update Point Query 1500 Codeforces Round #849 i forgor how i made this problem, but I thought it was nice.
044 Teleporters (Easy Version) and Teleporters (Hard Version) 1100/1900 Codeforces Round #849 I thought of making a problem with sorting by $$$i + a_i$$$, and this popped out.

I do intend to keep this list live as I write more problems. Thanks for reading!

Full text and comments »

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

By flamestorm, 15 months ago, In English

We hope you enjoyed the contest!

1791A - Codeforces Checking

Idea: flamestorm

Tutorial
Solution

1791B - Following Directions

Idea: flamestorm

Tutorial
Solution

1791C - Prepend and Append

Idea: flamestorm

Tutorial
Solution

1791D - Distinct Split

Idea: SlavicG

Tutorial
Solution

1791E - Negatives and Positives

Idea: SlavicG

Tutorial
Solution

1791F - Range Update Point Query

Idea: flamestorm

Tutorial
Solution

1791G1 - Teleporters (Easy Version)

Idea: flamestorm

Tutorial
Solution

1791G2 - Teleporters (Hard Version)

Idea: flamestorm

Tutorial
Solution

Full text and comments »

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

By flamestorm, 17 months ago, In English

We hope you enjoyed the contest! Sorry for the late editorial.

1760A - Medium Number

Idea: flamestorm

Tutorial
Solution

1760B - Atilla's Favorite Problem

Idea: SlavicG

Tutorial
Solution

1760C - Advantage

Idea: Errichto

Tutorial
Solution

1760D - Challenging Valleys

Idea: mesanu

Tutorial
Solution

1760E - Binary Inversions

Idea: SlavicG

Tutorial
Solution

1760F - Quests

Idea: flamestorm

Tutorial
Solution

1760G - SlavicG's Favorite Problem

Idea: SlavicG

Tutorial
Solution

Full text and comments »

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

By flamestorm, 18 months ago, In English

Thanks for participating!

1742A - Sum

Idea: flamestorm

Tutorial
Solution

1742B - Increasing

Idea: mesanu

Tutorial
Solution

1742C - Stripes

Idea: flamestorm

Tutorial
Bonus
Solution

1742D - Coprime

Idea: badlad, SlavicG

Tutorial
Solution

1742E - Scuza

Idea: mesanu

Tutorial
Solution

1742F - Smaller

Idea: SlavicG

Tutorial
Solution

1742G - Orray

Idea: SlavicG

Tutorial
Solution

Full text and comments »

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

By flamestorm, 20 months ago, In English

Thanks for participating!

1722A - Spell Check

Idea: mesanu, MikeMirzayanov

Tutorial
Solution

1722B - Colourblindness

Idea: flamestorm

Tutorial
Solution

1722C - Word Game

Idea: flamestorm

Tutorial
Solution

1722D - Line

Idea: flamestorm

Tutorial
Solution

1722E - Counting Rectangles

Idea: mesanu

Tutorial
Solution

1722F - L-shapes

Idea: MikeMirzayanov

Tutorial
Solution

1722G - Even-Odd XOR

Idea: mesanu

Tutorial
Alternate Tutorial Sketch
Solution

Full text and comments »

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

By flamestorm, 21 month(s) ago, In English

Thanks for participating!

1703A - YES or YES?

Idea: flamestorm

Tutorial
Solution

1703B - ICPC Balloons

Idea: flamestorm

Tutorial
Solution

1703C - Cypher

Idea: mesanu

Tutorial
Solution

1703D - Double Strings

Idea: MikeMirzayanov

Tutorial
Solution

1703E - Mirror Grid

Idea: mesanu

Tutorial
Solution

1703F - Yet Another Problem About Pairs Satisfying an Inequality

Idea: flamestorm

Tutorial
Solution

1703G - Good Key, Bad Key

Idea: mesanu

Tutorial
Solution

Full text and comments »

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

By flamestorm, 22 months ago, In English

Thank you for participating in our contest! We hope you enjoyed it.

1698A - XOR Mixup

Hint
Solution
Implementation (C++)
Implementation (Python)

1698B - Rising Sand

Hint
Solution
Implementation (C++)
Implementation (Python)

1698C - 3SUM Closure

Hint
Solution
Implementation (C++)

1698D - Fixed Point Guessing

Hint
Solution
Implementation (C++)
Implementation (Python)

1698E - PermutationForces II

Hint 1
Hint 2
Hint 3
Solution
Implementation (C++)

1698F - Equal Reversal

Hint
Solution
Implementation (C++)

1698G - Long Binary String

Hint
Solution
Implementation (C++)

Full text and comments »

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

By flamestorm, 22 months ago, In English

Hi Codeforces!

ScarletS and I are glad to invite you to Codeforces Round 803 (Div. 2) which will be held on Jun/28/2022 17:35 (Moscow time). The round will be rated for participants with rating lower than 2100. The theme of the round will be déjà vu! (Wait, wasn't that already a theme before?)

Thanks to the people who made this round possible:

Thanks to NEAR for supporting this round, details can be found in this post.

You will have 135 minutes to work on (and solve!) 7 problems. At most one of the problems will be interactive. Make sure to read this blog and familiarize yourself with these types of problems before the round!

The scoring distribution is $$$250-500-1000-1500-2000-2500-3250$$$.

Good luck, and see you on the scoreboard!

UPD: Editorial is out!

Full text and comments »

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

By flamestorm, 22 months ago, In English

Thanks for participating!

1692A - Marathon

Idea: mesanu

Tutorial
Solution

1692B - All Distinct

Idea: mesanu

Tutorial
Solution

1692C - Where's the Bishop?

Idea: flamestorm

Tutorial
Solution

1692D - The Clock

Idea: SlavicG

Tutorial
Solution

1692E - Binary Deque

Idea: flamestorm

Tutorial
Solution

1692F - 3SUM

Idea: flamestorm

Tutorial
Solution

1692G - 2^Sort

Idea: flamestorm

Tutorial
Solution

1692H - Gambling

Idea: mesanu

Tutorial
Solution

Full text and comments »

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

By flamestorm, 2 years ago, In English

Hello Codeforces!

SlavicG, mesanu, MikeMirzayanov, Errichto, and I welcome you to Codeforces Round 790 (Div. 4). It starts on May/10/2022 17:45 (Moscow time).

The format of the event will be the same as before:

  • 5-8 tasks;
  • ICPC rules with a penalty of 10 minutes for an incorrect submission;
  • 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
  • after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated
  • by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer).

We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants.

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behavior. To qualify as a trusted participant of the fourth 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 1400 or higher in the rating.

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.

Many thanks to the testers: timreizin, magnus.hegdahl, Adam_GS, KrowSavcik, qwexd, pseudocoder10, jampm, Neophiliatic, Codula and of course _Vanilla_.

We suggest reading all of the problems and hope you will find them interesting!

Good luck!

UPD: the start of the round is delayed by 10 minutes.

UPD: Editorial is published!

Full text and comments »

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

By flamestorm, 2 years ago, In English

Thanks for participating!

1669A - Division?

Idea: SlavicG

Tutorial
Solution

1669B - Triple

Idea: Errichto

Tutorial
Solution

1669C - Odd/Even Increments

Idea: mesanu

Tutorial
Solution

1669D - Colorful Stamp

Idea: flamestorm

Tutorial
Solution

1669E - 2-Letter Strings

Idea: SlavicG

Tutorial
Solution

1669F - Eating Candies

Idea: MikeMirzayanov

Tutorial
Solution

1669G - Fall Down

Idea: MikeMirzayanov

Tutorial
Solution

1669H - Maximal AND

Idea: SlavicG

Tutorial
Solution

Full text and comments »

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

By flamestorm, 3 years ago, In English

Thank you for participating in our contest! We hope you enjoyed it. UPD: Implementations have been added.

1567A - Domino Disaster

Solution
Implementation (C++)
Video Solution

1567B - MEXor Mixup

Solution
Implementation (C++)
Video Solution

1567C - Carrying Conundrum

Solution (Observation)
Implementation (C++)
Video Solution
Solution (DP)
Implementation (C++)

1567D - Expression Evaluation Error

Solution
Implementation (C++)
Video Solution

1567E - Non-Decreasing Dilemma

Solution
Implementation (C++)
Video Solution

1567F - One-Four Overload

Solution
Implementation (C++)
Video Solution

Full text and comments »

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

By flamestorm, 3 years ago, In English

Thank you for competing! I hope you had fun in the contest. UPD: Implementations have been added.

103150A - Addition Range Queries

Short Solution
Editorial
Implementation

103150B - Arrowing Process

Short Solution
Editorial
Implementation

103150C - EZPC Sort

Short Solution
Editorial
Implementation

103150D - Moving Points

Short Solution
Editorial
Implementation

103150E - o

Short Solution
Editorial
Implementation

103150F - Palindromicity

Short Solution
Editorial
Implementation

103150G - Segmentation Fault

Short Solution
Editorial
Author's Note
Implementation

103150H - William Tell

Short Solution
Editorial
Implementation

103150I - X-OR XOR

Short Solution
Editorial
Implementation

Full text and comments »

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

By flamestorm, 3 years ago, In English

Hello, Codeforces!

I would like to invite you all to my first contest, EZ Programming Contest #1. It will be held on Jun/23/2021 18:35 (Moscow time). The round is not rated for anybody, since it is an unofficial contest.

The contest has $$$n$$$ problems, where $$$n$$$ is an integer satisfying $$$7 \leq n \leq 11$$$. You will have 2 hours and 30 minutes to solve the problems. The problems are meant to be about Div. 2 A, B, and C level, and they will not be sorted in order of difficulty. So, you can think of the problemset like if ICPC only went up to Div. 2 C.

A huge thanks to my testers wabadabakalakaboo, manish.17, and fishy15!

I know you all are filled with questions, so I'll try to answer them all now.

  • Q: Is it rated?
  • A: No.
  • Q: Why did you write this contest?
  • A: I have a lot of ideas for easy Div. 2 A, B, and C level problems, not all of which can get into a contest. I thought it would be fun to compile them all into one contest anyways, and hey, it might actually be good practice for beginners or just anyone who wants to practice solving these types of problems quickly!
  • Q: Why didn't you propose the problems to other platforms?
  • A: uuuuuuhhhhhh idk. I just thought it would be fun to give these problems to Codeforces, since that's where I do most of my competitive programming :P.
  • Q: Do you think this will be good practice for beginners?
  • A: Yeah! It's a long-form contest (2.5 hours), but I think all the problems are approachable by beginners.
  • Q: Is there anything unusual about the format of the contest?
  • A: The round is ICPC-style. I wanted to make it like ICPC but for early Div. 2 problems. This means that the problems won't be sorted in order of difficulty. So, I encourage you to read all the problems ;).
  • Q: Is it rated?
  • A: No.

Thank you all for reading this far. Good luck, have fun, and I hope to see you on the scoreboard!

UPD1: The editorial is out!

UPD2: Also, like most contests, I want to congratulate the winners, so here they are:

Overall winners (individual):

  1. Geothermal

  2. Maksim1744

  3. vkgainz

  4. IceKnight1093

  5. Hodobox

Div. 2 winners (individual):

  1. RBurgundy

  2. Makise_Kurisu

  3. tredsused70

  4. O--O

  5. govindsaju

Team winners:

  1. Absalom: paramk, klexis, _webhub_

  2. Sh00nya bata Sh00nya: dadboss, mexomerf, Athem

  3. LeanMeanFightingMachines: KabirKanha, VAICR7BHAV, ProfessorChaos

  4. Time Limit Defeated: blitztage, a_manglani, suneet27

  5. Bugged House: MvKaio, naniim

Thank you all so much for participating, and I hope to see you again soon!

Full text and comments »

Announcement of EZ Programming Contest #1
  • Vote: I like it
  • +197
  • Vote: I do not like it