UK British Algorithmic Olympiad
A two-part BAO preparation route for ambitious students: maths training for precise Olympiad reasoning, plus coding training for implementing BAO-style rules, recurrences and small state-space searches.
BAO questions often require both mathematical reasoning and careful implementation. Students can use one track or combine both depending on their current strengths.
For students who need stronger mathematical maturity before tackling full BAO problems. The focus is precise notation, sequences, counting, proof, recurrence and multi-part Olympiad reasoning.
For students who can code but need BAO-specific implementation practice. The focus is translating rules into Python, implementing recurrences, using light DP and searching small state spaces.
The maths track bridges school maths and algorithmic Olympiad reasoning. Students learn to read precise questions, choose efficient methods and justify results.
Sets, number sets, set-builder notation, union, intersection, functions, domains, ranges and input-output rules.
Coordinates, distance, straight lines, gradients, intersections, radians, arcs, sectors and motion around a circle.
Arithmetic sequences, geometric sequences, finite sums, recurrence relations, closed forms and repeated-process reasoning.
Multiplication principle, factorials, permutations, over-counting, inclusion-exclusion, at least one, neither and exactly one.
Deduction, counterexamples, proof by exhaustion and contradiction, with attention to why an answer is true.
Multi-part BAO-style questions that combine notation, sequences, counting, proof, geometry and recurrence ideas.
The coding track focuses on implementation patterns that appear in BAO-style problems, where mathematical structure and accurate rule translation matter more than generic contest speed.
Translate BAO problem rules into accurate Python code, with careful handling of cases, states and outputs.
Implement sequences and recurrence relations using loops or recursion where appropriate.
Store previous results or visited states to avoid repeated work. This is light DP for BAO-style reasoning, not advanced contest DP.
Use cumulative totals to solve repeated-sum or range-style problems efficiently.
Use queue-based search to find minimum steps or minimum turns in small transformation problems.
Learn how BAO problems connect mathematical structure with implementation, including when to use light DP, memoisation or BFS instead of brute force.
BAO preparation is related to competition coding, but the balance is different. Students need to understand the maths behind the implementation.
Perse-style preparation often rewards accessible puzzle solving and coding confidence. BAO usually asks for more formal reasoning and multi-step mathematical structure.
BIO-style coding can emphasise implementation and algorithmic problem solving. BAO adds a stronger maths layer: proof, recurrence, counting and precise interpretation.
USACO training often moves into broader data structures and performance-heavy algorithms. BAO training stays closer to mathematical reasoning plus careful coding.
Clear answers for families deciding whether this route fits their child's current coding level, goals and schedule.
It is for students who already have some school maths and coding confidence, and who want to prepare for BAO-style problems that combine mathematical reasoning with implementation.
BAO Math Training builds the reasoning base: notation, sequences, counting, proof, recurrence and geometry. BAO Coding Training turns those ideas into Python programs using simulation, recurrence implementation, prefix sums, light memoisation and BFS.
No. The BAO coding track describes this as light DP and memoisation. Students learn to store previous results or visited states where useful, but the focus is BAO-style reasoning rather than advanced DP-heavy contest training.
Students should have a reasonable school-maths foundation. The maths training is designed to build the maturity needed for BAO-style notation, recurrence, counting, proof and multi-part problem solving.
BAO sits between maths reasoning and coding implementation. Perse can be more puzzle-accessible, BIO often emphasises coding implementation, and USACO often moves into broader algorithm performance. BAO needs students to connect formal maths with accurate code.
Start with the BAO entry test if the student wants the coding track, then decide whether they need maths training, coding training, or a combined plan.