#include<stdio.h>
#include<conio.h>
void main()
{
int n,r,rev=0;
printf("Enter a number");
scanf("%d",n);
while(n!=0)
{
r=n%10;
rev=rev*10+r;
n=n/10;
}
printf("\n Reverse Number = %d",rev);
}
Monday, March 9, 2020
Write a program to check the given number is palindrome or not.
#include<stdio.h>
#include<conio.h>
void main()
{
int n,sum=0,temp,d;
printf("\n Enter a number ");
scanf("%d",&n);
temp=n;
while(n!=0)
{
d=n%10;
sum=sum*10+d;
n=n/10;
}
if(temp==sum)
printf("\n Palindrome");
else
printf("\n Not Palindrome");
}
#include<conio.h>
void main()
{
int n,sum=0,temp,d;
printf("\n Enter a number ");
scanf("%d",&n);
temp=n;
while(n!=0)
{
d=n%10;
sum=sum*10+d;
n=n/10;
}
if(temp==sum)
printf("\n Palindrome");
else
printf("\n Not Palindrome");
}
Write a program to calculate factorial using recursive function.
#include<stdio.h>
#include<conio.h>
int fact(int n)
void main()
{
int n,f;
printf("enter a number ");
scanf("%d",n);
f=fact(n);
printf("\n Factorial of %d is %d",n,f");
}
int fact(int n)
{
if (n<=1)
return(1);
else
return(n*fact(n-1));
}
#include<conio.h>
int fact(int n)
void main()
{
int n,f;
printf("enter a number ");
scanf("%d",n);
f=fact(n);
printf("\n Factorial of %d is %d",n,f");
}
int fact(int n)
{
if (n<=1)
return(1);
else
return(n*fact(n-1));
}
Subscribe to:
Posts (Atom)
pattern
55555 4444 333 22 1 #include <stdio.h> int main() { int i,j; for(i=5; i>=1; i--) { for(j=1; j<=i;...
-
#include<stdio.h> #include<conio.h> void main() { int n,r,rev=0; printf("Enter a number"); scanf("%d...
-
#include<stdio.h> int main() { char vol; int ascii; printf("enter number"); scanf("%c",&vol); asc...
-
#include <stdio.h> int main() { ...