Several situations of using bijections in combinatorial proofs are presented, including finding the number of paths in a lattice. Some olympiad-type problems are given as examples. The text is intended for upper class students of the Mathematical High School.