Hello Codeforces!
Today I'll be writing about what I have learnt about combinatorics, which played, and, in my opinion, will still be playing an important role in both Codeforces and CP (short for competitive programming).
However, combinatorics is such a great subject that made that impossible for me to write it all in one blog. So, this is just the fourth blog, which is friendly to beginners. If you are interested, please, pay attention to this account and I'll give posts as series for a long term.
If you have found some mistakes in the text, or if you have some questions about the topic, please, leave a comment, and I'll check it weekly and reply. Also, if you find some grammar mistakes, a kind comment will be also welcomed.
Previous Blogs
- Combinatorics (1), basics.
- Combinatorics (2), implementations.
- Combinatorics (3), arrays and recurrence relations.
Content
- Homework Tutorial
- generating function
- using generating function to solve problems
- group theory
- permutation group
- Burnside's lemma
- Polya's enumeration theorem
- Polya's enumeration theorem under generating functions
- using Polya's enumeration theorem to solve problems
- Homework
