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.
Project Euler #191: Prize Strings
Project Euler #191: Prize Strings
Sort by
recency
|
12 Discussions
|
Please Login in order to post a comment
anyone knows that f(4,1,3,3)=43 what is the logic behind that i am facing problem to understand this one????
ADMIN can you please give some mTre explanation as it is not seeming to fall in the EASY Category rather medium would be better.
What are variables and what is formula in the description please can you explain the Sample Test Case ?
I am having trouble solving this problem. The approach I came up with for finding f is calculating the total possible permutations of the numbers 0 through (c-1) and then subtracting all the permutations that do not meet the criteria (over n zeros/m consecutive ones).
Am I on the right track or is there a better way to go about it? Also, are there any concepts that I could study that would help me solve this problem?
Can anyone please help me to understand the question? I am too confused what to do
Can anyone have accepted solutions share some sample inputs and outputs? really appreciate it!