Language:	Russian
	English

Remote Training on Programming

Problems	Online status	Contests
News	FAQ	E-learning

For authors:

Forgot your password?

Authors ranklist

About project

Hello, Guest! Please login or register.

660. Number of combonations

Time Limit:	1 seconds
Memory Limit:	65536KB
Points:	100

View Problem Statistics

Submit

Problem added Игорь Андрианов

Заданы целые числа 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

Problem discussion

Author/source:

Educational Courses /

Algorithms and Data Structures /

Enumeration, Dynamic Programming, Greedy algs /

2142. Knapsack - 1

660.

1959. Numbers in Cells

296. Palindrom

1179. Requests for presentations

Problems from Contests and Camps /

Trainings of Vologda SU /

Training 24.12.2008 /

656. Amount of Numbers - variant 4

660.

time generating 0.094 sec.