Project Euler 115 - Counting Block Combinations II
Project Euler 115 - Counting Block Combinations II
Official link: https://projecteuler.net/problem=115
Harder version of Problem 114
Embedded Files
Thought Process
Thought Process
As stated in the problem, this is a harder version of Problem 114. The below result is a generalisation
Interactive Code
Interactive Code
Enter a number (yourinput)
Code will output least value n, such that F(50,n) > yourinput
Page updated
Google Sites
Report abuse