void main()
{
int x1,x2,x3,n,i;
x1=0;
x2=1;
printf("enter a value for n : ");
scanf("%d",&n);
printf("%d %d ",x1,x2);
for(i=3;i<=n;i++)
{
x3=x1+x2;
printf("%d ",x3);
x1=x2;
x2=x3;
}
}

void main()
{
int x1,x2,x3,i;
x1=-1;
x2=1;
printf("enter the value for n  :");
scanf("%d",&n);
print
for(i=0;i<n;i++)
{
x3=x1+x2;

if((x3 mod 2)!=0)
{
printf("%d   ",x3)
}
x1=x2;
x2=x3;
}

}

void main()
{
int x1,x2,x3,i,n;
x1=-1;
x2=1;
printf("enter the value for n  :");
scanf("%d",&n);
print
for(i=0;i<n;i++)
{
x3=x1+x2;

if((x3 mod 2)!=0)
{
printf("%d   ",x3)
}
x1=x2;
x2=x3;
}

}

int main()
{
	int f=0,s=1,t=1,n,fl;
	printf("enter the limit\t:");
	scanf("%d",&n);
	printf("\nfirst %d prime fibonacci numbers 
are\n",n);
	while(n)
	{
		fl=0;
		fl=prime(f);
		if(f>1 && fl==1)
		{
			printf("%d\t",f);
			n=n-1;
		}
		s=t;
		t=f;
		f=s+t;
	}
}

int prime(int x)
{
	int i,f=0;
	for(i=2;i<=x/2;i++)
	{
		if(x%i==0)
		{
			f=1;
			break;
		}
	}
	if(f==0)
	{
		return 1;
	}
	else
		return 0;

}