/* N-bonacci numbers The Fibonacci sequence is a set of numbers that starts with a one or a zero, followed by a one, and proceeds based on the rule that each number is equal to the sum of the preceding two numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ... We can generalize this to an N-bonacci sequence, where the sum of the preceding N numbers form the next term. For example, a 3-bonacci sequence is the following: 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, ... Write a program which takes two inputs: N and M, and gets the M-th term of any N-bonacci sequence. For example: Input: (N, M) = (4, 13) Output: 0, 0, 0, 1, 1, 2, 4, 8, 15, 29, 56, 108, 208 Bonus: Try to solve this both recursively and iteratively. Here is recursive solution. Report me if you find any bugs. Good luck! */ #include // Recursive function for getting each therm of // sequence step by step int getFibonacci(int a, int b) { int sum=0; // Gentlly handle starter 0 and 1 of sequences. // Obviously, we can find pattern here: // For 2-Fibonacci {0,1,...} // For 3-Fibonacci {0,0,1,...} // For 4-Fibonacci {0,0,0,1,...} if(b<(a-1)) sum=0; if(b==(a-1)) sum=1; // For other else request would be actual // calculation of numbers: if(b>=a) for(int j=1;j<=a;j++) sum+=getFibonacci( a, (b-j) ); return sum; } // Main function starts here: int main() { // Declaration of variables int a,b; // First things first, so here we input range of // Fibonacci sequence, for 2 it's would be sum of // 2 step numbers, for sum of 3 and so go on //std::cout<<"\nEnter type of Fibonacci sequence: "; std::cin>>a; // Then we input how many numbers we want to be // printed //std::cout<<"\nEnter how many therms: "; std::cin>>b; // Here actual result outputed: std::cout<<"\nThere are a first "<

Challenge: First 'b' numbers from 'a'-Fibonacci sequence