← Retour à l'épreuve

Kazakhstan FAIO 2024 · Énoncé

A. Choosing rocket

Mis en forme par IOAI Training à partir de l'original (BeksultanSagyndyk/faio-tasks, licence Apache-2.0). L'original fait foi.

https://contest.yandex.ru/contest/71291/problems/A/

Time limit: 1 second Memory limit: 64 MB Input: standard input or input.txt Output: standard output or output.txt

The team is preparing to fly on a business trip to a space station. They need to choose k rocket components out of n. In how many ways can they do this? The order of selection does not matter.

Two natural numbers n and k are given. Output the answer to the problem.