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.
Hi,
I am not getting what is going on after step 1. I understand that we have to get sum of prime factors returned by binomial coefficient of N and M, but i want to understand role of K.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Project Euler #231: The prime factorisation of binomial coefficients
You are viewing a single comment's thread. Return to all comments →
Hi, I am not getting what is going on after step 1. I understand that we have to get sum of prime factors returned by binomial coefficient of N and M, but i want to understand role of K.