C Programming Examples: Armstrong Numbers, Prime Numbers, Palindromes, and More
WAP to display armstrong number from 1 to 1000
Program :
#include <stdio.H>
void main()
{
int i,n,d,sum=0;
for(i=1;i<=1000;i++)
{
n=i;
sum=0;
while(n!=0)
{
d=n%10;
sum=sum+d*d*d;
n=n/10;
}
if(sum==i)
{
printf(“%d\n”,i);
}
}
}
Output :
1
153
370
371
407
Write a program to check if the entered number is prime or not.
Program :
#include <stdio.H>
void main()
{
int i=2,n;
printf(“Enter a number\n”);
scanf(“%d”,&n);
while(n%i!=0)
{
i++;
}
if(n==i)
{
printf(“The number %d is prime”,n);
}
else
{
printf(“The number %d is not prime”,n);
}
}
Output :
Enter a number
17
The number 17 is prime
factorial of 5 is 120
x raise to y by recursive function.
#include <stdio.H>
void main()
{
int x,y,ans;
int power(int x, int y);
printf(“Enter base and its power : \n”);
scanf(“%d%d”,&x,&y);
ans=power(x,y);
printf(“%d raise to %d is %d”,x,y,ans);
}
int power(int x, int y)
{
if(y==0)
return 1;
else
return (x*power(x,y-1));
}
Output :
Enter base and its power :
5
3
5 raise to 3 is 125
Write a program to generate
A
B B
C C C
D D D D
Program :
#include <stdio.H>
void main()
{
int i,j;
for(i=1;i<=4;i++)
{
for(j=1;j<=4-i;j++)
{
printf(” “);
}
for(j=1;j<=i;j++)
{
printf(“%c “,i+64);
}
printf(“\n”);
}
}
Output :
A
Write a program to generate
1
2 3
4 5 6
7 8 9 10
Program :
#include <stdio.H>
void main()
{
int i,j,k=1,n=4;
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
printf(“%d “,k++);
}
printf(“\n”);
}
}
Output :
1
2 3
4 5 6
7 8 9 1066
Write a program to find summation of n numbers using recursion.
Program :
#include<stdio.H>
void main()
{
int n,sum=0;
int summation(int n);
printf(“Enter a number :”);
scanf(“%d”,&n);
sum=summation(n);
printf(“Sum of numbers from 1 to n is %d”,sum);
}
int summation(int n)
{
if(n==1)
return 1;
else
return (n+summation(n-1));
}
Output :
Enter a number :5
Sum of numbers from 1 to n is 15
Write a C program to find GCD of two numbers using recursion.
Program :
#include<stdio.H>
void main()
{
int x,y,ans;
int gcd(int x, int y);
printf(“Enter two numbers\n”);
scanf(“%d%d”,&x,&y);
ans=gcd(x,y);
if(ans==1)
{
printf(“GCD does not exists”);
}
else
{
printf(“GCD=%d”,ans);
}
}
int gcd(int x, int y)
{
if(x%y==0)
return y;
else
return gcd(y,x%y);
}
Output :
Enter two numbers
12
30
GCD=6
WAP to check is the square matrix symmetric or not.
Program :
#include <stdio.H>
void main()
{
int i,j,n,count=0,a[10][10];
printf(“Enter number of rows or column\n”);
scanf(“%d”,&n);
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
{
printf(“Enter number of elements\n”);
scanf(“%d”,&a[i][j]);
}
}
printf(“The entered matrix is :\n”);
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
{
printf(“%d\t”,a[i][j]);
}
printf(“\n”);
}
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
{
if(a[i][j]!=a[j][i])
{
count++;
break;
}
}
}
if(count==0)
{
printf(“The given matrix is symmetric”);
}
else
{
printf(“The given matrix is not symmetric”);
}
}
Output :
Enter number of rows or column
3
Enter number of elements
1
Enter number of elements
2
Enter number of elements
3
Enter number of elements
2
Enter number of elements
5
Enter number of elements
3
Enter number of elements
3
Enter number of elements
3
Enter number of elements
7
The entered matrix is :
1 2 3
2 5 3
3 3 7
The given matrix is symmetric
Write a program to add two numbers using user defined functions.
Program :
#include <stdio.H>
void add(int x, int y)
{
int sum=0;
sum=x+y;
printf(“The sum of two numbers %d and %d is %d”,x,y,sum);
}
void main()
{
int x,y;
printf(“Enter two numbers\n”);
scanf(“%d%d”,&x,&y);
add(x,y);
}
Output :
Enter two numbers
5
7
The sum of two numbers 5 and 7 is 12
Write a program to check whether the entered string is palindrome or not.
Program :
#include <stdio.H>
void main()
{
int n=0,i;
char a[100],b[100];
printf(“Enter a string\n”);
scanf(“%s”,&a);
while(a[n]!=’\0′)
{
n++;
}
for(i=0;i<=n-1;i++)
{
b[n-i-1]=a[i];
}
for(i=0;i<=n-1;i++)
{
if(a[i]!=b[i])
break;
}
if(i==n)
printf(“Entered string is palindrome“);
else
printf(“Entered string is not palindrome”);
}
Output :
Enter a string
india
Entered string is not palindrome
Write a program to display all prime numbers from 1 to 50
Program :
#include <stdio.H>
void main()
{
int i,j,n;
for(i=2;i<=50;i++)
{
n=i;
j=2;
while(n%j!=0)
{
j++;
}
if(j==i)
{
printf(“%d,”,i);
}
}
}
Output :
2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,
Factorial of a function by recurssion function.
#include <stdio.H>
void main()
{
int n,factorial;
int fact(int n);
printf(“Enter a number : “);
scanf(“%d”,&n);
factorial=fact(n);
printf(“factorial of %d is %d”,n,factorial);
}
int fact(int n)
{
if(n==0)
return 1;
else
return (n*fact(n-1));
}
Output :
Enter a number : 5