If you are interested in participating in the Montgomery Blair Informatics Tournament, which will be held online from 1:00-4:00 PM EDT on Sunday (6/7/20), please register at https://mbit.mbhs.edu/.
Teams of up to 4 are allowed! Anyone can compete, but only teams of US high school (or middle school) students can win Amazon gift cards for prizes:
$50 per person for 1st place in Advanced Division
$25 per person for 1st place in Standard Division, 2nd place in Advanced Division, and 3rd place in Advanced Division
If you want to get a sense of what mBIT problems are like, take a look at the problems from our contest last November:
Rookie (Standard) problems | Rookie solutions | Test Rookie solutions here
Varsity (Advanced) problems | Varsity solutions | Test Varsity solutions here
Message me or email [email protected] if you have any questions!
UPDATE: The contest is over! You can view all results on our website.
Here are the problems:
Standard problems
Advanced problems
You can test out your solutions by submitting to these CF contests:
Standard contest
Advanced contest
Here are the editorials and solutions:
Standard solutions
Advanced solutions
We sincerely apologize with for the technical difficulties, and are working to ensure it doesn't happen again. Thank you to everyone who competed!
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
I assume it's supposed to be (6/7/20)?
Yep, my mistake.
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Is it rated?
Wow, what an amazing opportunity for teams of US high school or middle school students! It's a shame that I can't win any prizes, since I'm from Australia, but I'll be sure to stop by to check out some high-quality problems by high-quality problemsetters :)
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Wow, I’m excited!
Me too!
Me three!
me 4 omg nov mbit!!
Seems interesting.
May I ask how the divisions compare to Codeforces divisions? That might help some people gauge difficulty if they don't have time to look at the sample problems.
Standard is comparable to Div 3/Div 2 ABC.
Advanced is comparable to Div 2/Div 1.
I would say that Advanced is harder than that. It probably ranges from Div 2 C to Div 1 E.
Whoops, fixed.
Wow, celebrating the 10 year anniversary (plus a few days) of me graduating, very classy. :)
Did you go to Blair?
Yes, class of 2010.
is the website working well?
Our website is having some trouble. It should be back up soon.
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Anyone able to access the website?
Not yet, sorry. We're working on it.
Can we expect some hints/editorials to the problems after the contest ends? or atleast access to solutions? I don't wish to attempt it if otherwise is the case. :sweat_smile:
Yes, we will release editorials after the contest ends.
Thank you for the prompt reply!
I can submit code but it seems like the verdicts won't load.
I think it is working now!!!
Still doesn't work for me :(
Edit: working now, just very slow
I can't see the verdict, getting not found error page :/
Will problems be made available to upsolve?
Yes, I have updated the post with the links.
Thank you, I enjoyed the problems and this contest. Apart from the technical issues, the team did a great job.
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Is there any way we can get our submissions?
You can see the results on the leaderboard. If you really want to see the code you submitted for a specific problem, you can email us and we'll try to look for it (no guarantees though).
Also, what was the logic in hen hackers?
The Hen Hackers solution was based around the following: First find out which letters are present in the solution (62 queries) Then, use length two queries as a comparator in a sorting algorithm. For example, to find out if a is before b ask "ab". This takes O(nlogn) queries. By the end, you will have sorted the password.
This is soo cool!!
I was trying the $$$O(n^2)$$$ sort + some optimizations. Never struck me to use it as a comparator in gcc sort!!
Glad you enjoyed the problem! I had fun writing it.
I spent some good time doing some random_shuffle to try to find the right place, and then I realized the binary search.
Would it be possible to add the problem names to the CF contests? Right now they are just "A -", "B -", etc.
(And if it would be possible to add the PDF in the CF contest that would be nice.)
Yep, I've updated the problems and attached the statements under contest materials. Let me know if I made any errors.
Thanks, makes it much easier to use! Appreciate it.
gabrielwu by when will the editorials of the advanced problems be published?
We are currently finalizing the editorials and will publish them shortly.
Editorials are now published. See the updated post.
is the editorial published yet? if it is, can anyone please provide the link to that?
Not yet. I will update the blog when it's ready.
Editorials have just been published. See the updated post.
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).
Auto comment: topic has been updated by gabrielwu (previous revision, new revision, compare).