C programme for fibnocci series between limits

#include <stdio.h>
#include <conio.h>
 main()
{
int i,n1,n2,f1-=0,f2=1,f3;
printf("enter limits");
scanf("%d%D"<&n1,&n2);
do
{
f3=f1+f2;
if((f3>=n1)&&(f3<=n2))
printf("%d\n",f3);
f1=f2;
f2=f3;
}
while(f3<=n2);
getche();
}

C programme for fibnocci series

USING FOR LOOP

#include <stdio.h>
#include <conio.h>
 main()
{
int i,j=1,n,k;
printf("enter value");
scanf("%d",&n);
for(i=0;i<=n;);
{
printf("%d",i);
k=i+j;
j=i;
i=k;
}
getch();
}




USING ARRAYS



#include <stdio.h>
#include <conio.h>
 main()
{
a[0]=0;
a[1]=1;
printf("\n %d",a[0]);
printf("\n %d",a[1]);
for(x=2;x<n;x++)
{
printf("\n");
a[x]=a[x-1]+a[x-2];
printf("%d",a[x]):
}
getch();
}


ANOTHER CODE USING FOR LOOP





#include <stdio.h>
#include <conio.h>
 main()
{
int n,a=0,b=1,c=0;
printf("%d",&a);
printf("%d",&b);
for(c=0;c<n;)
c=b+a;
printf("%d",&c);
a=b;
b=c;
}

C programme to print twin prime numbers between limits

#include <stdio.h>
#include <conio.h>
 main()
{
int i,j,ip=1,count,n1,n2;
printf("enter limits");
scanf("%d%d",&n1,&n2);
for(i=n1;i<=n2;i++)
{
count=0;
for(j=1;j<=i;j++)
if((i%j)==0)
count++;
if(count==2)
{
if((i-ip)==2)
printf("%d%d",ip,i);
ip=i;
}
}

C programme for prime or not

USING FOR LOOP
#include <stdio.h>
#include <conio.h>
 main()
{
int n,i,s;
printf("enter n");
scanf("%d",&n);
for(i=1,s=0;i<=n;i++)
{
if(n%i=0)
s++;
}
if(s==2)
printf(" n is prime");
else
printf(" entered numb is not prime");
getch();
}

USING WHILE LOOP

#include <stdio.h>

#include <conio.h>

void main()

{
int n,i=2;
printf("enter numb");
scanf("%d",&n);
while(n%i!=0)
{
i=i+1;
}
if(n==i)
printf("prime numb");l
else
printf("not prime");
}

C programme for multiplication table

#include <stdio.h>
#include <conio.h>
void main()
{
int n,i=1,rem;
printf("enter n"):
scanf("%d",&n);
for(i=1;i<=10;i++)
{
rem=n*i;
printf("%d*%d=%d",n,i,rem);
}
getch();
}

C programme for pallindrome or not

#include <stdio.h>

#include <conio.h>

void main()

{

int n,rev=0,i,mod;

i=n;

clrscr();

printf("enter a number");

while(n>0)

{

mod=n%10;

rev=rev*10+mod;

n=n/10;

}

printf("reverse value is %d",rev);

if(rev==i)

printf("it is a pallindrome number");

else

printf("it is not a pallindrome number");

}

C programme for armstrong or not

#include <stdio.h>
#include <conio.h>
void main()
{
int n,num,a,b,c;
clrscr();
printf("enter a number");
a=n%10;
b=n/10%10;
c=(n/10)/10;
num=a*a*a+b*b*b+c*c*c;
if(n==num)
printf("armstrong number");
else
printf("not a armstrong number");
}