/**********************************************
* Section : 10
* Roll No. : 20CS10000 / 20CS30000
* Name : Aritra Hazra
* Assignment No : 4a
* Description : Generalized Higher-order
                Fibonacci Sequences
* Date : 27-Apr-2021
**********************************************/

#include <stdio.h>

#define MAX 100

int main()
{
    unsigned int order, i, j, term;
    unsigned long long int memory[MAX], next;
    
    // taking from user the inputs
    printf("++ Enter Order of Fibonnaci Sequence: ");
    scanf("%u", &order);
    printf("++ Enter Initial/Base Terms (space-separated): ");
    for(i=0; i<order; i++) {
        scanf("%llu", &memory[i]);
    }
    printf("++ Enter Number of Terms in Sequence to View: ");
    scanf("%u", &term);
    
    // generating and printing the higher-order fibonacci sequence
    printf("\n** The Fibonacci Sequence upto %u-th Term:\n", term);
    if(term <= order) { // asked sequence is within the range of initial terms
        for(i=0; i<term; i++) {   
            printf(" %llu ", memory[i]);
        }
    }
    else { // higher number of terms asked as sequence
        for(i=0; i<order; i++) { // printing all initial terms
            printf(" %llu ", memory[i]);
        }
        while(i<term) { // generating and printing all remaining terms
            for(j=0, next=0; j<order; j++) { // generating the next term
                next = next + memory[j];
            }
            printf(" %llu ", next); // printing the next term
            for(j=0; j<order-1; j++) { // adjusting immediate last set of saved terms
                memory[j] = memory[j+1];
            }
            memory[j] = next; // appending the newly generated term
            i++;
        }
    }
    printf("\n");

    return 0;
}