It’s that time of the (school) year again, and to celebrate, we present the Back to School '19 contest! Get back into your tip top programming shape and start the school year with a new rating!
There will be 8 problems, with expected difficulty ranging from CCC Junior to IOI level. The problem setters are Ninjaclasher, Zeyu, Beautiful_Times and wleung_bvg. Good luck to all participants!
We're excited to invite you to Another Contest 5, the first rated contest to be run under the new AtCoder format!
This contest format is slightly different from the format used for other contests, so please see the contest
page for all the technical details.
Anyone with a DMOJ account is welcome to participate, and anyone without one is welcome to register and participate. Contestants may participate in any 2-hour window on the weekend of July 20th.
From June 29th to July 1st, we'll be hosting Wesley's Anger Contest! By popular demand, all problems in this contest will have some graph theory component.
Anyone with a DMOJ account is welcome to participate, and anyone without one is welcome to register and participate.
Contestants may participate in any 4-hour window between June 29th, 9:00 AM to July 1st, 11:59 PM. Please see the contest page for more details.
After a nearly year-long hiatus, we're excited to announce the 2018-19 Trudeau Logic Evaluation!
The problem setters of this contest are eric574, Darcy_Liu, and __, the current leaders of the Pierre Elliott Trudeau High School Computer Science Club. But don't fret, as all problems have been tested and approved by ZQFMGB12 and d!
Thanks for participating in the DMOPC '18 March contest!
Once again, we apologize for the incorrect P6. It has been removed from the contest. Anyone who feels they were significantly affected by this is asked to DM Kirito on Slack.
Congratulations to everyone who got a perfect score!
Editorials for each of the problems have been uploaded to the respective problem pages.
We hope you enjoyed the contest, and we hope to see you at DMPG!
On Tuesday, March 12th we'll be hosting the March DMOJ Monthly Open Programming Contest!
Anyone with a DMOJ account is welcome to participate, and anyone without one is welcome to register and participate.
Contestants may participate in any 3-hour window between noon EST of Mar. 12th and noon EST of Mar. 13th. Please see the contest page for more details.
Editorials for each of the problems have been uploaded to the respective problem pages.
We hope you enjoyed the contest, and see you next month!
On Sunday, February 17th and Monday, February 18th, we'll be hosting the February DMOJ Monthly Open Programming Contest!
Anyone with a DMOJ account is welcome to participate, and anyone without one is welcome to register and participate.
Contestants may participate in any 3-hour window between 9:00 am EST of Feb. 17th and 9:00 pm EST of Feb. 18th. Please see the contest page for more details.
Editorials for each of the problems have been uploaded to the respective problem pages.
We hope you enjoyed the contest, and see you next year!
As the academic year comes to an end, we'll be holding our final DMOPC in the form of the Don Mills Programming Gala.
This event will take place at Don Mills C.I. on Thursday, April 25th.
The contest will be split into three divisions of increasing difficulty, with prizes awarded to the top competitors. For interested competitors unable to attend the on-site event, we will also be hosting mirrors of the divisions, open for anyone to participate in.
Space is limited, so sign up soon! More details and registration options may be found here. You can find the results of last year's DMPG here.
We welcome you to this year's Valentine's Day Contest! Because the CCC is coming up, the Valentine's Day Contest will be in CCC format, with two divisions, each with five problems each to solve in 3 hours, with a maximum of 50 submissions per problem. The window will open at 9AM EST on the 14th and will run until 9PM on the 16th.
We'll be running both junior and senior divisions. Please see the respective contest pages for more details.
