Pagini recente » Diferente pentru blog/finala-algoritmiada-2015 intre reviziile 7 si 6 | Diferente pentru blog/osss intre reviziile 1 si 2 | Diferente pentru blog/combinatorics-shortlist intre reviziile 23 si 22 | Diferente pentru blog/combinatorics-shortlist intre reviziile 41 si 40 | Diferente pentru blog/combinatorics-shortlist intre reviziile 27 si 26
Nu exista diferente intre titluri.
Diferente intre continut:
print ‘*’
==
How many stars will be printed for a given n and k.
# [1] How many ways can k rooks be placed on a nxn chessboard so that they don’t attack each other.
#_ [1] 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]) How many permutations of length n have no fixed points. A fixed point in a permutation p is p(i) = i
# (county level olympiad, 1994 [1]) How many correct bracket sequences of length 2n are there.
# (10th grade math course) How many paths are there on a grid from 1,1 to n, m if at each step you can either increase your x coordinate or increase your y coordinate.
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
