Competitive Marathon

Programming marathon problems and solutions — Beecrowd, Codeforces, Atcoder and friends.

---

Repository structure

Everything is organized in the same way for every online judge:

Online Judge
└── Contest (number, name or date — *if* any)
    └── Problem (letter, number or name)

Example

OBI/
└── Metro/                         # problem = Metro
    ├── metro.cpp                  # solution
    ├── metro.in                   # sample input
    └── metro.in2                  # extra test input

The judges currently covered:

Judge	Folder	Contest folder	Problem folder
OBI (Olímpíada Brasileira de Informática)	OBI/	year & phase (e.g. 2015-F1)	problem name (e.g. Metro)
Beecrowd	Beecrowd/	—	problem number (e.g. 1001)
Codeforces	Codeforces/	contest id & name (e.g. 158-A)	problem letter (e.g. A-Next-Round)

Running the solutions

g++ -O2 -std=c++17 OBI/Metro/metro.cpp -o metro
./metro < OBI/Metro/metro.in

Conventions

• Solutions are written in C++ (anything from C++11 to C++23).
• Each problem folder may include test inputs (*.in) and, if needed, a short note on the approach.

Problem statements belong to their respective judges/olympids.