Deck · IOI — Competitive Programming

Combinatorics & Counting

Counting techniques for competitive programming: permutations and combinations, binomial coefficients and identities, multinomial coefficients, stars and bars, inclusion-exclusion, pigeonhole, Catalan and Stirling numbers, Bell numbers, integer partitions, generating functions, Burnside's lemma, Polya enumeration, lattice paths, linear-recurrence counting, and probability via counting.

66 cards · audited · SM-2 spaced repetition

or go All-Access →

Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.

Sample cards

1

Rule of product (multiplication principle)

2

Rule of sum (addition principle)

3

Factorial

4

Permutations of n distinct objects

5

k-permutations (arrangements of k from n)

Showing 5 of 66 cards. Unlock the program to study them all.

More in IOI — Competitive Programming

Advanced Computational Geometry49 cardsAdvanced Graph Algorithms, Flows & Matching63 cardsGeneral Algorithmic Techniques & Analysis79 cardsFundamental Data Structures78 cardsDynamic Programming81 cardsCombinatorial Game Theory49 cards

Master combinatorics & counting — and the rest of IOI — Competitive Programming.

One program. 964 audited cards across 14 decks.

or go All-Access →

See the full program →