/* 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 */ #include class End{}; templatestruct Terms{ static const uintmax_t Head = t; using Tail = T ; }; templatestruct Start{ typedef Terms::result> result ; }; templatestruct Start<0,i>{ typedef End result ; }; template constexpr uintmax_t Next = T::Head + Next ; template constexpr uintmax_t Next = 0 ; templatestruct N_B_Facade{ typedef typename N_B_Facade,T>,N,M-1>::result result ; }; templatestruct N_B_Facade{ typedef T result ; }; templatestruct N_Bonacci{ typedef typename N_B_Facade::result,N,M-N>::result result; }; #include template void print(bool i=false){ print(true); std::cout << T::Head ; if(i) std::cout <<", "; } template<> void print(bool){} #define N_BONACCI(N,M) \ typedef N_Bonacci::result n_bonacci_##N##_##M ;\ std::cout<< #N << "_Bonacci("<< #M <<") : "\ << "#" << #M << " term : " \ << n_bonacci_##N##_##M::Head \ << std::endl \ << "Series : " ; \ print(); \ std::cout<< std::endl << std::endl ; \ int main() { N_BONACCI(0,10) N_BONACCI(1,10) N_BONACCI(2,10) N_BONACCI(3,11) N_BONACCI(4,13) N_BONACCI(5,20) N_BONACCI(9,30) N_BONACCI(40,100) return 0; }

[CHALLENGE] N#Bonacci