Codeforces Round #429 (Div. 2):C、&840A、 Leha and Function
题目: Leha like all kinds of strange things. Recently he liked the function F(n, k). Consider all possible k-element subsets of the set [1, 2, ..., n]. For subset find minimal element in it. F(n, k) — m