1. Fibonacci Number Given a number N,figure out if it is a member of fibonacci series or not.Return true if the number is memebr of fibonacci sereis else false.
    Fibonacci Series is defined by the recurrence
    F(n) = F(n-1) + F(n-2)
    where F(0) = 0 and F(1) = 1

    Input Format :
    Integer N
    Output Format :
    true or false
    Constraints :
    0 <= n <= 10^4
    Sample Input 1 :
    5
    Sample Output 1 :
    true
    Sample Input 2 :
    14 Sample Output 2 :
    false
    
#include
using namespace std;
            
bool isFib(int n){
    int i=1;
    int fisrtNum=0;
    int secondNum=1;
    if(n==0 || n==1){
        return true;
    }
    while(i<=n){
        int x= fisrtNum+secondNum;
        if(x==n){
            return true;
        }
        fisrtNum=secondNum;
        secondNum=x;
            
        i++;
    }
               
    return false;
               
}
int main(){
    cout<<"ENTER YOUR NUMBER: "<<endl;
    int x;
    cin>>x;
    int y= isFib(x);
    cout<<y<<endl;
}

    2. This is the first item's accordion body. It is shown by default, until the collapse plugin adds the appropriate classes that we use to style each element. These classes control the overall appearance, as well as the showing and hiding via CSS transitions. You can modify any of this with custom CSS or overriding our default variables. It's also worth noting that just about any HTML can go within the .accordion-body, though the transition does limit overflow.

    This is the second item's accordion body. It is hidden by default, until the collapse plugin adds the appropriate classes that we use to style each element. These classes control the overall appearance, as well as the showing and hiding via CSS transitions. You can modify any of this with custom CSS or overriding our default variables. It's also worth noting that just about any HTML can go within the .accordion-body, though the transition does limit overflow.
    \