|
Remote Training on Programming
|
| Hello, Guest! Login or register. |
660. Number of combonations
|
| View Problem Statistics | Submit | Problem added Undefined |
Заданы целые числа N и M. Необходимо вычислить величину C(N,M) - число сочетаний из N по M. Вход Два числа N и M (0 < N <= 33, 0 <= M <= N). Числа разделены пробелом. Выход Величина C(N,M). Примеры входных и выходных данных INPUT OUTPUT 7 3 35 22 22 1 0 0 |
| View Problem Statistics | Submit | Author/source: |
| Educational Courses / | Data Structures and Algorithms / | Enumeration, Dynamic Programming, Greedy algs / |
| 14. Expression | 660. | 296. Palindrom. | 37. Simple Numbers | 295. Zoo |
| Problems from Contests / | Trainings of Vologda STU / | Training 24.12.2008 / |
| 656. Amount of Numbers - variant 4 | 660. |
| We can all benefit by doing occasional "toy" programs, when artificial restrictions are set up, so that we are forced to push our abilities to the limit. The art of tackling miniproblems with all our energy will sharpen our talents for the real problems. Donald E. Knuth. |
| time generating 0.406 sec. |
| © Copyright VSTU, AVT, Nosov D.A. |