We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- All Contests
- ProjectEuler+
- Project Euler #53: Combinatoric selections
Project Euler #53: Combinatoric selections
Project Euler #53: Combinatoric selections
Contest ends in
This problem is a programming version of Problem 53 from projecteuler.net
There are exactly ten ways of selecting three from five, :
In combinatorics, we use the notation,
In general,
It is not until , that a value exceeds one-million:
How many, not necessarily distinct, values of , for , are greater than K?
Input Format
Input contains two integers and .
Constraints
Output Format
Print the answer corresponding to the test case.
Sample Input
23 1000000
Sample Output
4