Fibonacci Roots

QUESTION:
The first two terms in the Fibonacci sequence are 0 and 1, respectively, and each subsequent term is the sum of the previous two. Using this definition to calculate the first several terms in the sequence, we get
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
Let us define the Fibonacci roots of a positive integer n to be the two smallest consecutive Fibonacci numbers whose sum is greater than or equal to n.

Input Format:
Input consists of a single integer which corresponds to n.
Assumption:
Assume that n is less than or equal to 2000.
Output Format:
Output consists of integers, separated by a space.

Sample Input 1 :
31
Sample Output 1:
13 21

Sample Input 2 :
89
Sample Output 2:
34 55

SOLUTION:

#include<stdio.h>
int main()
{
    int a=0,b=1,c=0,n;
    scanf("%d",&n);
    while(1)
    {
        c=a+b;
        if(c>=n)
        goto END;
        a=b;
        b=c;
    }
    END: printf("%d %d",a,b);
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Implementing a Fixed size Queue of maximum size 5 using an array

QUESTION: Consider implementing a fixed size queue of maximum size 5 using an array. Create a structure struct queue { int contents[5]; int front; int count; } ; Note that the array contents holds the contents of the queue and the integer front stores the index of the front element in the queue. Write a program to implement enQueue and deQueue operation on queue and to display the contents of the queue. In the initQueue function intialize the value of front and count to 0. Print the message “Queue is full” in the enQueue function when an attempt is made to insert a data into a full queue. Print the message “Queue is empty” in the deQueue function and return the value -1000 when an attempt is made to delete data from an empty queue. Refer function specifications for further details. Input and Output Format: Refer sample input and output for formatting specifications. Note that the statement “The contents of the queue are” is in the main
Read more

Implementing a Dynamically sized stack using array

QUESTION: Consider implementing a dynamically sized stack using an array. Create a structure struct stack { int * a; int top; int maxSize; }; The structure stack has a pointer 'a' to a dynamically allocated array (used to hold the contents of the stack), an integer 'maxSize' that holds the size of this array (i.e the maximum number of data that can be held in this array) and an integer 'top' which stores the array index of the top element in the stack. Write a program to implement push and pop operation on stack and to display the contents of the stack. In the initstack function intialize the value of top to -1 and initialize the value of maxSize. Print the message “Stack is full” in the push function when an attempt is made to push a data into a full stack. Print the message “Stack is empty” in the pop function and return the value -1000 when an attempt is made to pop data from an empty stack. Refer function specificati
Read more

Functions - Null Matrix

QUESTION: Write a program to find whether the given matrix is null or not using functions. A null matrix is a matrix in which all its elements are zero. Function specification: int checkNull(int **a, int m, int n) The first argument corresponds to the pointer to an array. The second argument corresponds to the number of rows. The third argument corresponds to the number of columns. The function returns a value of 1 if it is a null matrix and 0 otherwise. Input and Output Format: Assume that the maximum number of rows and columns in the matrix is 10. Refer sample input and output for formatting specifications. All text in bold corresponds to input and the rest corresponds to output. Sample Input and Output 1: Enter the number of rows in the matrix 3 Enter the number of columns in the matrix 2 Enter the elements of the matrix 2 4 1 3 0 9 The matrix is 2 4 1 3 0 9 The matrix is not null Sample Input and Output 2: Enter th
Read more