Sum of two digit

#include<stdio.h>

int main()

int a,b,c;

printf("enter first number \n");

scanf("%d",&a);

printf("enter second number \n");

scanf("%d",&b);

c=a+b;

printf("%d\n",c);

return 0;

Check the number odd or even

#include<stdio.h>

int main()

int x;

printf("enter a number =");

scanf("%d",&x);

if(x%2==0){

printf("even number");

else{

printf("odd number");

return 0;
LOWER CASE AND UPPER CASE (IFF ELSE CONDITION)
#include<stdio.h>
int main()
{
char ch;
printf("enter character :");
scanf("%c",&ch);

if(ch>= 'A'&&ch<='Z'){
printf("upper case \n");
}
else if(ch>= 'a'&&ch<='z'){
printf("lower case \n");
}
else{
printf("not english letter");
}
return 0;
}

Switch statement
#include<stdio.h>
int main()
{
int n;
printf("Enter yuor choice:");
scanf("%d",&n);
switch(n){
case 1:
printf("monday....\n");
break;
case 2:
printf("tuesday....\n");
break;
case 3:
printf("wedsesday....\n");
break;
case 4:

printf("thursday....\n");
break;
break;case 5:
printf("friday....\n");
break;
case 6:
printf("saturday....\n");
break;
case 7:
printf("sunday....\n");
break;
default :
printf("wrong choice...\n");
}
return 0;
}

While loop
#include<stdio.h>
int main()
{
int n=1;
while (n<5)
{
printf("AISECT UNIVERSITY");
n++
}
return 0;
}
Count of digit
#include<stdio.h>
int main()
{ int n,count=0;
printf("enter anumber.......\n");
scanf("%d",&n);
while (n>0)
{ n=n/10;
count++;
}
printf("the count of
digit..=%d",count);
return 0;
}

Fibonacci series
#include<stdio.h>
int main()
{
int a=0,b=1;
int n,r;
printf("enter how many terms you want...\n");
scanf("%d",&n);
while(n>0)
{
r=a+b;
printf("%d\t",r);
a=b;
b=r;
n--;
}
return 0;
}
#include<stdio.h>

int main()

{int n;

printf("enter a number\n");

scanf("%d",&n);

int rev=0;v

while(n>0)

rev=rev*10;

rev=rev+(n%10);

n=n/10;

printf("revers of a number is %d",rev);

return 0;

Palindrome number
#include<stdio.h>

int main()

{int n,r,rev=0,m;

printf("enter a number=");

scanf("%d",&n);

m=n;

while(n>0)

{ r=n%10;

rev=rev*10+r;

n=n/10;

} if(m==rev)

printf("palindrome numder=%d\n",m);

else

printf("not a palionbdrome number");

return 0;

}
Armstrong number
#include<stdio.h>

int main(){

int n,m,r,i,t,pow,count=0,sum=0;

printf("enter any number");

scanf("%d",&n);

m=n;

while(n>0)

n=n/10;

count++;

t=m;

while(m>0)

pow=1;

r=m%10;

for(i=1;i<=count;i++)

pow=pow*r;

sum=sum+pow;

m=m/10;

if(sum==t)

printf("armstrong number is =%d",t);

else

printf("%d is not armstrongnumber",t);

return 0;

}
Factorial
#include<stdio.h>

int main()

{ int n,fact=1;

printf("enter a no...\n");

scanf("%d",&n);

while(n>0)

{ fact=n*fact;

n--;

if(n<0)

printf("invalid number");

else(n>0);

printf("the factorial=%d\n",fact);

return 0;

Continue statement
#include<stdio.h>

int main()

int i=1;

while(i<=5)

if (i==4)

continue;

printf("%d\t",i);

i++;

return 0;
}

Triangle pyramid
#include<stdio.h>

int main()

{ int i,j;

for(i=1;i<=5;i++)

{ for(j=1;j>=i;j++)

printf("Aisect\t");

printf("\n");

return 0;

Number pyramid
#include<stdio.h>

int main()

{int n,i,j;

printf("enter no of rows=\n");

scanf("%d",&n);

int a=n;

for(i=1;i<=n;i++)

{ for(j=1;j<=a;j++)

{ printf("%d",j);

a--;

printf("\n");

return 0;

Odd number pyramid

#include<stdio.h>

int main()

{int n,i,j;

printf("enter no of rows=\n");
scanf("%d",&n);

//int a=1;

for(i=1;i<=n;i++)

{ int a=1;

for(j=1;j<=i;j++)

printf("%d",a);

a=a+2;

printf("\n");

return 0;

Star plush pyramid

#include<stdio.h>

int main()

{int n,i,j;

printf("enter no of rows=");

scanf("%d",&n);

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

{ int a=n/2+1;

if(i==a||j==a)

printf("*");

else

printf(" ");

printf("\n");

return 0;

Cross pyramid
#include<stdio.h>

int main()
{

int a,b,i,j;

printf("enter no of rows=");

scanf("%d",&a);

printf("enter no of columns=");

scanf("%d",&b);

for(i=1;i<=a;i++)

for(j=1;j<=b;j++)

if(i==j||i+j==a+1)

printf("*");

else

printf(" ");

printf("\n");

return 0;

Prime /composite number

#include<stdio.h>

int main()

{int n,i;

printf("enter a number");

scanf("%d",&n);

int a=0;

for(i=2;i<n;i++)

if(n%i==0)

a=1;

break;

if(n==1)
printf("1 is neither composit nor prime");

else if(a==0)

printf("%d is prime number",n);

else

printf("%d is compositnumber",n);

return 0;

Sum of array element

#include<stdio.h>

int main()

{ int ar[5],i,sum;

printf("enter array element.....\n");

for(i=0;i<5;i++)

scanf("%d",&ar[i]);

printf("\n\n");

for(i=0;i<5;i++)

sum=sum+ar[i]:

printf("the sum of array element=%d",sum);

return 0;

Check odd or even in array

#include<stdio.h>

int main()

{ int ar[5],i;

printf("enter array element.....\n");

for(i=0;i<5;i++)

scanf("%d",&ar[i]);

printf("\n\n");

printf("array element are...\n\n");

for(i=0;i<5;i++)

if(ar[i]%2==0)
printf("%d even number\n",ar[i]);

else

printf("%d odd number\n",ar[i]);

return 0;

Sum of odd or even number in array

#include<stdio.h>

#include<conio.h>

int main()

int I,arr [5],x=0,y=0,sum=0;

printf("enter any number\n");

for(i=0;i<5;i++)

scanf("%d",&arr [i]);

printf("\n\n");

for(i=0;i<5;i++)

sum=sum+arr [i];

if(arr [i]%2==0)

printf("%d is even number...\n",arr [i]);

x=x+arr [i];

else

printf("%d is odd number...\n",arr [i]);

y=y+arr [i];

printf("the sum of even number :%d\n",x);

printf("the sum of odd number :%d\n",y);

printf("the sum of all number :%d\n",sum);

getch();

return 0;

}
Smallest number in array
#include<stdio.h>

int main()

int arr[5],i,smaller;

printf("enter aqny number :\n");

for(i=0;i<5;i++)

scanf("%d",&arr [i]);

printf("\n\n");

smaller=arr [0];

for(i=0;i<5;i++)

if(arr [i]<smaller)

smaller=ar[i];

printf("smaller number is =%d",smaller);

return 0;

Reverse of array element

#include<stdio.h>

int main()

int arr[5],i,r,rev;

printf("enter array number :\n");

for(i=0;i<5;i++)

scanf("%d",&arr[i]);

printf("\n\n");

for(i=0;i<5;i++)

rev=0;

while(arr[i]>0)

r=arr[i]%10;

rev=rev*10+r;

ar[i]=arr[i]/10;
}

printf("reverse number of each array =%d\n",rev);

return 0;

Swaping of array element

#include<stdio.h>

int main()

int arr[5],i,x;

printf("enter array number :\n");

for(i=0;i<5;i++)

scanf("%d",&arr [i]);

x=arr[0];

arr [0]=arr [4];

arr [4]=x;

printf("\n\n");

for(i=0;i<5;i++)

printf("after swiping%d\t",arr [i]);

return 0; }

sum of two number

#include<stdio.h>

int main()

int a[3][3],b[3][3],c[3][3],i,j;

printf("enter array element...\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

scanf("%d",&a[i][j]);

printf("first array element\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)
{

printf("%d\t",a[i][j]);

printf("\n\n");

printf("enter second array element\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

scanf("%d",&b[i][j]);

printf("second array element\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

printf("%d\t",b[i][j]);

printf("\n\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

c[i][j]=a[i][j]*b[i][j];

printf("sum of two matrics\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

printf("%d\t",c[i][j]);

printf("\n\n");

return 0;

}
Sum of row element
#include<stdio.h>

int main()

int array[3][3],i,j,sum;

printf("enter array element\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

scanf("%d",&array[i][j]);

for(i=0;i<3;i++)

for(j=0;j<3;j++)

printf("%d\t",array[i][j]);

printf("\n\n");

for(i=0;i<3;i++)

{ sum=0;

for(j=0;j<3;j++)

sum=sum+array[i][j];

printf("the sum raw =%d\n",sum);

return 0;

Sum of column element of matrics

#include<stdio.h>

int main()

int array[3][3],i,j,sum;

printf("enter array element\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

{
scanf("%d",&array[i][j]);

for(i=0;i<3;i++)

for(j=0;j<3;j++)

printf("%d\t",array[i][j]);

printf("\n\n");

for(i=0;i<3;i++)

sum=0;

for(j=0;j<3;j++)

sum=sum+array[j][i];

printf("the sum column

=%d\n",sum);

return 0;

Sum of diagonal element of matrices

#include<stdio.h>

int main()

int array[3][3],i,j,sum=0;

printf("enter array element\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

scanf("%d",&array[i][j]);

for(i=0;i<3;i++)

for(j=0;j<3;j++)

printf("%d\t",array[i][j]);
}

printf("\n\n");

for(i=0;i<3;i++)

for(j=0;j<3;j++)

if(i+j==2)

sum=sum+array[i][j];

printf("the sum first diagonal =%d\n",sum);

return 0;

Multiplication of two matrices

#include<stdio.h>

int main()

int a[2][2],b[2][2],c[2][2],i,j,k;

printf("enter array element...\n");

for(i=0;i<2;i++)

for(j=0;j<2;j++)

scanf("%d",&a[i][j]);

printf("first array element\n"); for(i=0;i<2;i++)

for(j=0;j<2;j++)

printf("%d\t",a[i][j]);

printf("\n\n");

printf("enter second array

element\n");

for(i=0;i<2;i++)

for(j=0;j<2;j++)

scanf("%d",&b[i][j]);
}

printf("second array element\n");

for(i=0;i<2;i++)

for(j=0;j<2;j++)

printf("%d\t",b[i][j]);

printf("\n\n");

for(i=0;i<2;i++)

for(j=0;j<2;j++)

int sum=0;

for(k=0;k<2;k++)

sum=sum+a[i][k]*b[k][j];

c[i][j]=sum;

printf("multplication of two matrics\n");

for(i=0;i<2;i++)

for(j=0;j<2;j++)

printf("%d\t",c[i][j]);

printf("\n\n");

return 0;

Transpose of a matrices
#include<stdio.h>

int main()

int a[2][2],b[2][2],i,j;

printf("enter array element...\n");

for(i=0;i<2;i++)
{

for(j=0;j<2;j++)

scanf("%d",&a[i][j]);

printf("first array element\n");

for(i=0;i<2;i++)

for(j=0;j<2;j++)

printf("%d\t",a[i][j]);

printf("\n\n");

for(i=0;i<2;i++)

for(j=0;j<2;j++)

b[i][j]=a[j][i];

printf(" transpose of a matrics\n");

for(i=0;i<2;i++)

for(j=0;j<2;j++)

printf("%d\t",b[i][j]);

printf("\n\n");

return 0;

Sum of two number by fumction

#include<stdio.h>

void sum (int x,int y);

int main()

int a,b;

printf("enter two number\n");

scanf("%d%d",&a,&b);

sum (a,b);
return 0;

void sum(int x,int y)

printf("the sum of two no=%d",x+y);

Hcf of two number

#include<stdio.h>

int main()

int a,b,r;

printf("enter first number=");

scanf("%d",&a);

printf("enter second number=");

scanf("%d",&b);

while(b>0)

r=a%b;

a=b;

b=r;

printf("hcf=%d",a);

return 0;

combination
#include<stdio.h>

int factorial(int x){

int fact =1;

int i;

for(i=1;i<=x;i++)

fact =fact*i;

return fact;

int main()

int i,n,r;

printf("enter the value of n=\t");

scanf("%d",&n);

printf("enter the value of r =\t");

scanf("%d",&r);

int ncr=factorial(n)/(factorial(r)*factorial(n-r));

printf("combination = %d",ncr);

return 0;

Sum of digit by recursion

#include<stdio.h>

int sumofdigit(int x);

int main()

int n,r;

printf("enter a no...\n");

scanf("%d",&n);

r=sumofdigit(n);

printf("the sum of digit =%d",r);

return 0;

int sumofdigit(int n)

if(n/10==0)

return n;

return n%10+sumofdigit(n/10);

Decreasing order by recursion

#include<stdio.h>

int decreasing(int x)

if(x==0)

return 0;

printf("%d\t",x);

return decreasing(x-1);

int main()

{int n;

printf("enter a number");

scanf("%d",&n);

decreasing(n);

return 0;

}
Summation of series
#include<stdio.h>

void ar(int n);

int main()

int n;

printf("enter a no...\n");

scanf("%d",&n);

ar(n);

void ar(int n)

int i,sum=0;

for(i=1;i<=n;i++)

sum=sum+i;

printf("the summation of series=%d\n",sum);

Straight line prove

#include<stdio.h>

int main()

{double x1,x2,x3,y1,y2,y3;

printf("enter the cordinate of point A=\n");

scanf("%d%d",&x1,&y1);

printf("enter the cordinate of point B=\n");

scanf("%d%d",&x2,&y2);v

printf("enter the cordinate of point C=\n");

scanf("%d%d",&x3,&y3);

double m1=(y2-y1)/(x2-x1);

double m2=(y3-y2)/(x3-x2);

if(m1==m2)

printf("points A B C are fall on straight line");

else

printf("points A B C are not fall on straight line");

} return 0;

}
Prime factor
#include<stdio.h>

int main()

int n,i;

printf("enter a number");

scanf("%d",&n);

for(i=2;i<=n;i++)

if(n%i==0)

printf("%d\t",i);

n=n/i;

i=1;

return 0;

Power of any number.

#include<stdio.h>

int power(int m,int n);

int main()

int x,y,t;

printf("Enter number to find power.");

scanf("%d",&x);

printf("Enter power.");

scanf("%d",&y);

t=power(x,y);

printf("%d Raised to the power %d, is=%d\n",x,y,t);

return 0;

int power(int m,int n)

if(n==0)

return 1;

return m*power(m,n-1);

}
//LCM .
#include<stdio.h>

int main()

int a,b,c,d,e,r1;

printf("Enter five number to find LCM.\n");

scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);

r1=((a>b&&a>c&&a>d&&a>e)?a:(b>c&&b>d&&b>e)?b:(c>d&&c>e)?c:(d>e)?d:e);

while(1)

if((r1%a==0)&&(r1%b==0)&&(r1%c==0)&&(r1%d==0)&&(r1%e==0))

printf("Lcm=%d\n",r1);

break;

r1++;

return 0;

//--->Factorial of n number using Recursion.

#include<stdio.h>

int fact(int n);

int main()

int x,t;

printf("Enter number for calculate factorial=");

scanf("%d",&x);

t=fact(x);

printf("The factorial of %d,is=%d",x,t);

return 0;

int fact(int n)

if((n==0)||(n==1))

return 1;

return n*fact(n-1);

}
count the num of elements in given array greater than
a given num x;
#include<stdio.h>

int main()

int i,n,m,count=0;

printf("Enter size of array=");

scanf("%d",&n);

int arr[n];

printf("Enter array element\n");

for(i=0;i<5;i++)

scanf("%d",&arr[i]);

printf("array element are..\n");

for(i=0;i<5;i++)

printf("%d\t",arr[i]);

printf("\n");

printf("Enter a number to check how much number are greater in this array to that number=");

scanf("%d",&m);

for(i=0;i<5;i++)

if(arr[i]>m)

count++;

printf("\n");

printf("%d are greater number in this array that you have enter number=%d\n",count,m);

return 0;

//total number of pairs in the array whose sum is equal

to given value x.
#include<stdio.h>

int main()

int n,i,j,x,count=0;

printf("Enter the size of Array.\n");

scanf("%d",&n);

int arr[n];

printf("Enter 1-D array element.\n");

for(i=0;i<n;i++)

scanf("%d.",&arr[i]);

printf("1-D array element are...\n");

for(i=0;i<n;i++)

printf("%d\t",arr[i]);

printf("\n");

printf("Enter a number to check how many sum of pairs are found to that number in this array=");

scanf("%d",&x);

printf("pair are:-");

for(i=0;i<n;i++)

for(j=i+1;j<n;j++)

if(arr[i]+arr[j]==x)

printf("(%d,%d).",arr[i],arr[j]);

count++;

printf("\n");

printf("The count of pairs are=%d.",count);

return 0;

//--->print 1 to n number using Recursion .

#include<stdio.h>

void printnum(int n);

int main()

int x;

printf("Enter number to
print.");

scanf("%d",&x);

printnum(x);

return 0;
}

void printnum(int n)

if(n==0)

return;

printnum(n-1);

printf("%d\t",n);

return;

//---->Reverse number of array each element.

#include<stdio.h>

void array(int arr[],int s);

int main()

int n,i;

printf("Enter size of array=");

scanf("%d",&n);

int arr[n];

printf("Enter 1-D arry element\n");

for(i=0;i<n;i++)

scanf("%d",&arr[i]);

printf("1-D arry element are.\n");

for(i=0;i<n;i++)

printf("%d\t",arr[i]);

printf("\n");

array(arr,n);

printf("The reverse of each array element are.\n");

for(i=0;i<n;i++)

printf("%d\t",arr[i]);

return 0;

void array(int arr1[],int s)

int i,rev,r;

for(i=0;i<s;i++)
{

rev=0;

while(arr1[i]>0)

r=arr1[i]%10;

rev=rev*10+r;

arr1[i]=arr1[i]/10;

arr1[i]=rev;

//--->check if the given array is a palindrome or not.

#include<stdio.h>

void palindrome(int arr[],int s);

int main()

int n,i;

printf("Enter size of array=");

scanf("%d",&n);

int arr[n];

printf("Enter 1-D arry element\n");

for(i=0;i<n;i++)

scanf("%d",&arr[i]);

printf("1-D arry element are.\n");

for(i=0;i<n;i++)

printf("%d\t",arr[i]);

printf("\n");

palindrome(arr,n);

return 0;

void palindrome(int arr1[],int s)

int i,j,temp,count=0;

for(i=0,j=s-1;i<j;i++,j--)

if(arr1[i]!=arr1[j])

count++;
break;

if(count==1)

printf("The given array are not palindrome .\n");

else

printf("The given array are palindrome .\n");

//-->Find the sum of digit of a number until the sum is reduced to 1 digit.
#include<stdio.h>

int main()

int n,i,r,sum;

printf("Enter any digit of number:-");

scanf("%d",&n);

printf("The sum of digit of number:- %d until the sum is reduced to 1 digit are: ",n);

while(n>0)

sum=0;

while(n>0)

r=n%10;

sum=sum+r;

n=n/10;

printf("-->%d",sum);

if(sum<10)

break;

else

n=sum;

return 0;

//-->number pyramid in the form of trangle.

#include<stdio.h>

int main()

int n,i,j,x=1;

printf("Enter number of terms:- ");

scanf("%d",&n);
for(i=1;i<=n;i++)

for(j=1;j<=i;j++)

printf("%d ",x++);

printf("\n");

return 0;

//-->number pyramid in the form of equalateral trangle.

#include<stdio.h>

int main()

int n,i,j,x=1;

printf("Enter number of terms:- ");

scanf("%d",&n);

for(i=1;i<=n;i++)

for(j=i;j<n;j++)

printf(" ");

for(j=1;j<=(2*i-1);j++)

if(j%2!=0)

printf("%d",x++);

else

printf(" ");

printf("\n");

return 0;

WAP to find a duplicate elements from a given array of integers.

#include<stdio.h>

void array(int arr1[],int s);

int main()

int n,i,j;

int arr[10]={1,2,3,2,6,8,9,4,3,6};
array(arr,10);

return 0;

void array(int arr1[],int s)

int i,j,t,x,y,z,count,check=0;

printf("The duplicate number in array are->\n");

for(i=0;i<s;i++)

count=0;

for(j=i+1;j<s;j++)

if(arr1[i]==arr1[j])

x=i;

z=j;

y=arr1[i];

count=1;

break;

if(count==1)

printf("%d ,and its index is=(%d,%d).\n",y,x,z);

//--->Lower-case to Uper-case of a strings.

#include<stdio.h>

#include<string.h>

void uprstring(char str1[])

int x=0,len=-1,i;

while(str1[x]!='\0')

len++;

x++;

for(i=0;i<=len;i++)

if(str1[i]>=97&&str1[i]<=122)

str1[i]=str1[i]-32;

}
}

int main()

int r;

char s1[100];

printf("Enter first string:-");

fgets(s1,50,stdin);

printf("String is:-%s",s1);

uprstring(s1);

printf("Uper-case of string is:- %s",s1);

return 0;