Hello, OnlineGDB Q&A section lets you put your programming query to fellow community users. Asking a solution for whole assignment is strictly not allowed. You may ask for help where you are stuck. Try to add as much information as possible so that fellow users can know about your problem statement easily.

How to print fibonacci no. series and prime no. series alternately ?

+1 vote
asked Aug 30, 2018 by Rushikesh Darne (130 points)
prime number should be at even place and fibonacci number at odd place

1 Answer

+2 votes
answered Aug 30, 2018 by Dev Stark
#include<stdio.h>
int main()
{
    int n;
    int a,b,x,i;//variable for fibbo
    int c,pos,j,z;//variable for prime
    scanf("%d",&n);//enter position
    if(n%2!=0)//if position is odd then calculate fibbo
    {
            a=1;
            b=1;
          if(n==1||n==3)
          {
            printf("%d",a);
          }
         else
        {
            for(i=2;i<(n/2+1);i++)
            {
                 x=a+b;
                 a=b;
                 b=x;
            }
           printf("%d",x);
         }
    }
    else//if position is even then calculate prime
    {
            pos=n/2;//for prime position
             z=1;
          for(i=1;i<100;i++)
          {
              c=0;
            for(j=1;j<=i;j++)
            {
               if(i%j==0)
               {
                c=c+1;

               }
            }
           if(c==2)
           {
              if(z++==pos)
              {
                printf("%d",i);
                break;
              }
           }
         }
    }
    return 0;
}
Welcome to OnlineGDB Q&A, where you can ask questions related to programming and OnlineGDB IDE and and receive answers from other members of the community.
...