# [1] What is the maximum product for set natural numbers that sum up to n.
# (romanian national olympiad, 10th grade, 2000 [1]) How many ways can you tile a 3xn rectangle with dominoes.
# (romanian IOI selection, 1999)

==code(c) |
  for i1 = 1,n
      for i2 = i1,n

               for ik = ik - 1,n
                   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.
# (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