DSA Week 1
Once preparing for the exam, Peter put in front of him n different cheating papers of his "favorite" subject "Calculus". And as during the semester Peter did not learn properly, there were so many cribs that they all can not fit into any pocket. Peter then found the maximum number of cribs, that he can take with him to the exam, and suddenly thought: how many ways are there to choose the right number of cribs?
Contains the total number of cribs n\:(1 \le n \le 12) and the number of cribs k\:(0 \le k \le n) that Peter can take with him.
Print the number of ways to choose k cribs from n.