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):
Div. 2 winners (individual):
Team winners:
LeanMeanFightingMachines: KabirKanha, VAICR7BHAV, ProfessorChaos
Time Limit Defeated: blitztage, a_manglani, suneet27
Thank you all so much for participating, and I hope to see you again soon!
The problems are nice and there is a good range of difficulties, so I suggest that everyone give the contest a try.
Glad you ended the sentence as "a try".
Since you have given a serial number to the contest, are you planning to conduct these contests frequently?
I'm not entirely sure yet. These contests do take some time to prepare, so I don't know how often they might occur.
However, in the case that I do end up hosting another round, I thought would be weird to have one round without a number and one round with one. So I decided to add the "#1" to the end of the contest :P.
Great work buddy .. respect ++ :)
I think it will be your first step towards writing a div-2 official round in future if in the past you are not done. By the way thanks a lot for this round.
Thanks for helping newbies flamestorm orz.
I'm looking forward to the contest!
Your contest graph is so encouraging man!
Your contest graph is so encouraging man!
Your contest graph is so encouraging man!
Your contest graph is so encouraging man!
Your contest graph is so encouraging man!
what about team participation (as it is ICPC style). Just asking it will be fun participating solo too.
Sure, I don't see any problem with that. I enabled participating with teams in the contest.
Where to register for this contest? I guess, the link is not working.
Registration is not open yet, it will open about six hours before the contest.
(I would’ve made the registration earlier, but unfortunately I don’t think I can change that in public gym contests.)
EDIT: Oops, it looks like registration opens 6 hours before the contest, not one day. My bad.
Will be very much pleased if you please give a reminder post or comment something in this post before that day so that the blog appear in RECENT ACTION so that by any chance if anyone forget about this contest, they can participate too :) thank you... And eagerly waiting for the round....
Will there be a editorial? (Just asking, although we can always discuss the problems here)
Most likely, yes. I will try my best to put an editorial out :).
REMINDER: The contest is in 1.5 days. You can register at this link 6 hours before the contest starts.
interesting way to explain the number of topics :)
REMINDER: The contest starts soon! The registration starts in about 6 hours, and the actual contest starts in about 12 hours. See you then!
Also, please note the unusual time: the contest starts 1 hour later than usual.
A reminder that this contest starts in just under 3 hours, and that registration is now open here!!
REMINDER: The contest starts in 30 minutes.
Thank you all for the overwhelming support! Good luck to you all, and have fun!
Will you published editorial or not ? UPD:Thanks for the fast editorial.
Very Good Contest.
The problem were really interesting.
How to solve problem F?
Just keep on repeating the same character as long as you can. My Submission
I hope you become one of the regular Div.3 problem setters.
Lovely Problemset! Looking forward to a rated div-3/2 from you. Is there a neat way to implement problem G? My solution is very case-worky.
My solution to G probably isn't neat but it doesn't involve much case-work, I used dp[lft][st] meaning the maximum number of digits with lft sticks left,and st is just an indicator for leading zeros https://codeforces.me/gym/103150/submission/120388851
With a bit of precomputation, it's possible to implement both minimum and maximum fairly neatly: my submission
Really Enjoyed the problems. Thanks for the contest!
You should consider conducting more such contests in the future