This content is archived!

For the 2018-2019 school year, we have switched to using the WLMOJ judge for all MCPT related content. This is an archive of our old website and will not be updated.

Introduction

Brute force typically just requires simple structures, such as for loops and if statements. However, complex problems may require recursion and some use of data structures.

Practice makes perfect!

Practice

DMOJ: List Minimum
DMOJ: Lexicographically Least Substring
DMOPC ‘15 C1 P3 - Itami and Cipher
DMOPC ‘15 C7 P3 - Harbourmaster
DMOPC ‘14 C7 P3 - Streetcars
MEC ‘16 P6 - Instruments of the Ghostwriters

Brute Force

Brute force is trying every single possibility. Brute force is often inefficient, but may suffice for certain problems.

This content is archived!

Introduction

Practice