Welcome to DMOJ Capture The Flag '21!

This contest is very different from others on the DMOJ platform. You should take a look at the previous DMOJ CTF to get an idea about how this one will be.

All problems are created by c.

Competition Parameters

• This CTF will run from February 1, 2021 12PM to February 8, 2021 12PM. You will have the full contest duration to capture the flags, this contest is not windowed.
• The scoreboard will be visible for the entire duration of the CTF.
• There will be some number of problems grouped into five categories: General, Web, Forensics, Reverse Engineering, and Exploitation.
• Each problem will be grouped through the contest ranking label. General problems will be prefixed with G, Web with W, Forensics with F, Reverse Engineering with R, and Exploitation with E.
• There will be no partials.
• The CTF will be run on the Atcoder format with a time penalty of zero. In other words, you will be ranked based on your score, breaking ties with the earliest time taken to achieve that score.
• This CTF will be unrated.
• There will be no limit on submissions (Note: this is not an open invitation to perform a timing attack).

Rules

• Do not share flags/solutions with other contestants during the entire duration of the CTF.
• You are free to use any materials you find on the internet.
• Do not attack the judge infrastructure, other contestants, or the problem authors/testers.

Flag Format

Unless otherwise specified, all flags will follow the regex ctf{[A-Za-z0-9_]{30,64}}.

Scoring

To follow the tradition of a CTF, all problems will be assigned a weight of ~500~ at the beginning of the contest and slowly decrease in weight as more contestants solve them. However, due to the overhead of recomputing problem weights live, we will only recompute problem weights once after the contest. Post contest, each problem will be assigned a weight using the following formulae:

Define $$\displaystyle \text{clamp}(a, x, b) = \begin{cases} a & \text{if } x < a \\ x & \text{if } a \le x \le b \\ b & \text{if } b < x \end{cases} $$

$$\displaystyle \text{score}(x) = -250 \tanh(4x - 1.5) + 285 $$

Each problem will be assigned a weight of ~\lceil \text{clamp}(50, \text{score}(p), 500) \rceil~, where ~p~ is ~\frac{\text{number of contestants who have solved this problem}}{\text{total number of contestants in the competition}}~.

Category-Specific Information

Web

Web problems are run on infrastructure hosted by the contest writer. For cost reasons, they will not be hosted beyond the contest duration.

After the contest, Docker build scripts will be provided for every web problem so you can host them yourselves.

Web problems will not be published after the contest, you will have to virtual the contest if you wish to do them.

Exploitation

Due to reproducibility issues with binary exploitation problems, this contest will contain exploitation problems that involve high-level programming languages instead of the exploitation of programs written in C/C++.

To simplify the exploitation process, the goal of each exploitation problem will be to output the flag to the standard error stream of the program you're exploiting.

Hint

This contest was written by a person who is deathly afraid of math and low-level programming. Do not expect problems that involve those particular fields.