Diferente pentru blog/combinatorics-shortlist intre reviziile #36 si #37
Nu exista diferente intre titluri.
Diferente intre continut:
print ‘*’ == How many stars will be printed for a given n and k.
# ([5], 'acm.sgu.ru':http://acm.sgu.ru/problem.php?contest=0&problem=222) How many ways can k rooks be placed on a nxn chessboard so that they don’t attack each other. # (romanian county olympiad, 11th grade 2000 [1], 'acm.sgu.ru':http://acm.sgu.ru/problem.php?contest=0&problem=356) How many permutations of length n have no fixed points. A fixed point in a permutation p is p(i) = i # ([1], county level olympiad, 1994) How many correct bracket sequences of length 2n are there.