FIBONACCI SERIES:

To print the n numbers in a series:

#include <stdio.h>
int main() {
int n,t1=0,t2=1,nextterm;
printf("enter the number:");
scanf("%d",&n);
if(n<0)
{
printf("invalid");
}
else
{
for(int i=1;i<=n;i++)
{
printf("%d ",t1);
nextterm=t1+t2;
t1=t2;
t2=nextterm;
}
}
}

To print the nth term in the series:

#include <stdio.h>
int main() {
int n,t1=0,t2=1,nextterm;
printf("enter the number:");
scanf("%d",&n);
if(n<0 || n>20)
{
printf("invalid");
}
else
{
for(int i=0;i<=n;i++)
{
nextterm=t1+t2;
 t1=t2;
t2=nextterm;
}
printf("%d ",nextterm);
}
}

MULTIPLICATION TABLE:

#include <stdio.h>
int main() {
int n,i,a;
printf("enter the number:");
scanf("%d",&n);
for(int i=1;i<=10;i++)
{
a=n*i;
printf("%d*%d=%d\n",n,i,a);
}
}

SUM OF ODD NUMBERS:

To print the sum of n numbers and their sum:

#include <stdio.h>
int main() {
int n,i,sum;
printf("enter the number:");
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
printf("%d\n",2*i-1);
sum+=2*i-1;
}
printf("the sum of n odd numbers is :%d",sum);
}

To print the numbers till n:

#include <stdio.h>
int main() {
int n,i,sum;
printf("enter the number:");
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
printf("%d\n",i);
sum=sum+i;
i=i+1;
}
printf("the sum of n odd numbers is :%d",sum);
}

PRIME NUMBER:

To check if a number is prime or not

#include <stdio.h>
int main()
{
int i,num, count = 0;
printf("enter a number:");
scanf("%d",&num);
for(i =1; i <= num; i++)
{
if(num% i == 0)
count ++;
}
if(num == 0 || num == 1)
printf("%d is not a prime number", num);
else if(count > 2)
printf("%d is not a prime number", num);
else
printf("\n%d is prime",num);
}
OR

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number:");
 scanf("%d",&n);
for(i=2;i<=n;i++)
{
if(n%i==0)
{
break;
}
}
if(i==n)
printf("prime number");
else
printf("not a prime number");
}

Prime numbers between a given range:

#include <stdio.h>
int main() {
int num1,num2,i,j;
printf("enter the first number:");
scanf("%d",&num1);
printf("enter the second number:");
scanf("%d",&num2);
for(i=num1;i<=num2;i++)
{
for(j=2;j<=num2;j++)
{
if(i%j==0)
{
break;
}
}
if(i==j)
printf("%d ",i);
}
}

To print prime numbers till the entered number:

Smallest Prime Number

#include <stdio.h>
int main() {
int n,i,j,sum=0;
printf("enter the number");
scanf("%d",&n);
for(i=n+1;sum<5;i++)
{
for(j=2;j<i;j++)
{
if(i%j==0)
{
break;
}
}
if(i==j)
{
printf("%d ",i);
sum++;
}
}
}

SERIES OF NUMBER AND THEIR SUM:

#include <stdio.h>
int main()
{
int i,n,range,temp,sum;
printf("enter a number:");
scanf("%d",&n);
printf("enter the range:");
scanf("%d",&range);
temp=n;
for(i=1;i<=range;i++)
{
printf("%d",n);
if(i!=range)
{
printf("+");
}
sum=sum+n;
n=n*10+temp;
}
printf("\n%d",sum);
}

PATTERN PRINTING:

Square pattern:

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("* ");
}
 printf("\n");
}

Hollow square pattern:

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if((i==0)||(i==n-1)||(j==0)||(j==n-1))
{
printf("* ");
}
else
{
printf(" ");
}
}
printf("\n");
}
}

(OR)

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if((i==1)||(i==n)||(j==1)||(j==n))
 {
printf("* ");
}
else
{
printf(" ");
}
}
printf("\n");
}
}

Half pyramid pattern:

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<i+1;j++)
{
printf("* ");
}
printf("\n");
}
}

Half pyramid using alphabets:

#include <stdio.h>
int main() {
int n,i,j;
char alphabet='A';
printf("enter the range:");
scanf("%d",&n);
if(n<0 || n==0)
printf("invalid");
else{
for(i=0;i<n;i++)
 {
for(j=0;j<=i;j++)
{
printf("%c ",alphabet);

}
printf("\n");
alphabet++;
}
}
}

To print multiple of 5:

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the range:");
scanf("%d",&n);
if(n<0 || n==0)
printf("invalid");
else{
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
printf("%d ",j*5);

}
printf("\n");
}
}
}

Pyramid Pattern

#include <stdio.h>
int main() {
int i,j,n,add=1;
printf("enter the number:");
scanf("%d",&n);
 for(i=0;i<=n;i++)
{
for(j=0;j<i;j++)
{
printf("%d ",add);
add++;
}
printf("\n");
}
}

Inverted half pyramid pattern:

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
printf("* ");
}
printf("\n");
}
}

Full pyramid pattern:

#include <stdio.h>
int main() {
int n,i,j,s;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(s=0;s<n-i-1;s++)
{
printf(" ");
}
 for(j=0;j<2*i+1;j++)
{
printf("* ");
}
printf("\n");
}
}

OR

#include <stdio.h>
int main() {
int n,i,j,s;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(s=0;s<n+i;s++)
{
if(s<n-i-1)
{
printf(" ");
}
else
{
printf("* ");
}
}
printf("\n");
}
}

Inverted full pyramid pattern:

#include <stdio.h>
int main() {
int n,i,j,s;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
 for(s=0;s<i;s++)
{
printf(" ");
}
for(j=0;j<2*n-2*i-1;j++)
{
printf("* ");
}
printf("\n");
}
}
OR

#include <stdio.h>
int main() {
int n,i,j,s;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<2*n-i-1;j++)
{
if(j<i)
{
printf(" ");
}
else
{
printf("* ");
}
}
printf("\n");
}
}

DIAMOND STAR PATTERN:

#include <stdio.h>
int main() {
int n,i,j,s,l;
printf("enter the number of rows:");
 scanf("%d",&n);
for(i=-n;i<=n;i++)
{
if(i<0)
l=-i;
else
l=i;
for(s=0;s<l;s++)
{
printf(" ");
}
for(j=0;j<2*(n-l)+1;j++)
{
printf("* ");
}
printf("\n");
}
}

OR

#include <stdio.h>
int main() {
int n,i,j,s,l;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=-n;i<=n;i++)
{
if(i<0)
l=-i;
else
l=i;
for(j=0;j<2*n-l+1;j++)
{
if(j<l)
{
printf(" ");
}
else
{
printf("* ");
 }
}
printf("\n");
}
}

MIRROR IMAGE STAR PATTERN:

#include <stdio.h>
int main() {
int n,i,j,s,l;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=-n;i<=n;i++)
{
if(i<0)
l=-i;
else
l=i;
for(s=0;s<n-l;s++)
{
printf(" ");
}
for(j=0;j<l+1;j++)
{
printf("* ");
}
printf("\n");
}
}
OR

#include <stdio.h>
int main() {
int n,i,j,s,l;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=-n;i<=n;i++)
 {
if(i<0)
l=-i;
else
l=i;
for(j=0;j<n+1;j++)
{
if(j<n-l)
{
printf(" ");
}
else
{
printf("* ");
}
}
printf("\n");
}
}

ANOTHER MIRROR PATTERN(ARROW):

#include <stdio.h>
int main() {
int n,i,j,s,l;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=-n;i<=n;i++)
{
if(i<0)
l=-i;
else
l=i;
for(j=0;j<l+1;j++)
{
printf("* ");
}
printf("\n");
}
}
INVERSE MIRROR PATTERN(ARROW):

#include <stdio.h>
int main() {
int n,i,j,s,l;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=-n;i<=n;i++)
{
if(i<0)
l=-i;
else
l=i;
for(s=0;s<n-l;s++)
{
printf(" ");
}
for(j=0;j<l+1;j++)
{
printf("* ");
}
printf("\n");
}
}
OR

#include <stdio.h>
int main() {
int n,i,j,s,l;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=-n;i<=n;i++)
{
if(i<0)
l=-i;
else
l=i;
for(j=0;j<n+1;j++)
{
if(j<n-l)
{
 printf(" ");
}
else
{
printf("* ");
}
}
printf("\n");
}
}

DOWN ARROW STAR PATTERN:

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<=n;i++)
{
for(j=-n;j<=n;j++)
{
if((-n+i)<j && j< (n-i))
{
printf(" ");
}
else
{
printf("* ");
}
}
printf("\n");
}
}

PATTERN PRINTING USING INCREMENT OF NUMBERS:

#include <stdio.h>
int main() {
int n,i,j,sum=1;
printf("enter the number of rows:");
 scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
printf("%d ",sum);
sum++;
}
printf("\n");
}
}

Using alphabets:

#include <stdio.h>
int main() {
int n,i,j;
char alphabet='A';
printf("enter the number of rows:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
{
printf("%c ",alphabet);
}
printf("\n");
alphabet++;
}
}

Multiple of 5:

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
 {
printf("%d ",j*5);
}
printf("\n");
}
}

Inverse pattern printing using numbers:

#include <stdio.h>
int main() {
int n,i,j;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
printf("%d ",j+1);

}
printf("\n");
}

FLOYDS TRIANGLE:

#include <stdio.h>
int main() {
int n,i,j,sum=1;
printf("enter the number of rows:");
scanf("%d",&n);
for(i=0;i<=n;i++)
{
for(j=0;j<i;j++)
{
printf("%d ",sum);
sum++;
}
printf("\n");
 }
}

Divisor Sum and Equality Checker

#include <stdio.h>
#include<math.h>
int main() {
int n,i,count=0,sum;
printf("enter the number:");
scanf("%d",&n);
for(i=1;i<n;i++)
{
if(n%i==0)
{
sum=sum+i;
printf("%d ",i);

}
}
if(sum==n)
printf("\n%d is an equal number",n);
else
printf("\n%d is not an equal number",n);
}

Abundant Number

#include <stdio.h>
#include<math.h>
int main() {
int n,i,count=0,sum;
printf("enter the number:");
scanf("%d",&n);
for(i=1;i<n;i++)
{
if(n%i==0)
{
sum=sum+i;
printf("%d ",i);
 }
}
if(sum>n)
printf("\n%d is an abundant number",n);
else
printf("\n%d is not an abundant number",n);
}

Counted the number of leap and non-leap years

#include <stdio.h>
#include<math.h>
int main() {
int i,n,count=0;
scanf("%d",&n);
if((n%400==0) || ((n%4==0) && (n%100!=0)))
printf("leap year");
else
printf("not a leap year");
for(i=n+1;i<=n+10;i++)
{
if((i%400==0) || ((i%4==0) && (i%100!=0)))
{
count++;
}
}
printf("\n%d ",count);
int x=10-count;
printf("\n%d ",x);
}

Sum of Squares of N Natural Numbers

#include <stdio.h>
int main() {
int n,i,sum=0;
printf("Enter the number of terms: ");
scanf("%d", &n);
if(n<0)
printf("invalid");
else
 {
for(i=0;i<=n;i++)
{
sum=sum+(i*i);

}
printf("%d",sum);
}
}

Harmonic Series

#include <stdio.h>
int main() {
int n;
float i,sum=0;
printf("Enter the number of terms: ");
scanf("%d", &n);
if(n<0)
printf("invalid");
else
{
for(i=1;i<=n;i++)
{
sum=sum+1/i;

}
printf("%.2f",sum);
}
}

Swap the Digits:

#include <stdio.h>
#include<math.h>
int main() {
int n,i,t,r,q,value,count=0,s;
printf("enter the number:");
scanf("%d",&n);
t=n;
while(n!=0)
 {
count++;
n=n/10;
}
r=t%10;
q=t%(int) (pow(10,count-1));
s=t/pow(10,count-1);
value=(r*pow(10,count-1)+q)-r+s;
printf("%d\n",value);
}

Perfect Cubes:

#include <stdio.h>
#include<math.h>
int main() {
int n,i,cube;
printf("enter the number:");
scanf("%d",&n);
if(n==0 || n<0)
printf("invalid");
else
{
for(i=n;i<=n+2;i++)
{
cube=i*i*i;
printf("%d\n",cube);
}
}
}

Sum of N odd and Even numbers

#include <stdio.h>
int main() {
int n,i,sum=0,value=0;
printf("enter the range:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
if(i%2==0)
 {
sum=sum+i;
}
else if(i%2!=0)
{
value=value+i;
}
}
printf("sum of odd numbers :%d\n",value);
printf("sum of even numbers: %d",sum);
}

Detecting Narcissistic Numbers

#include <stdio.h>
#include<math.h>
int main() {
int n,i,sum=0,r;
printf("enter the number:");
scanf("%d",&n);
int t=n;
int count=log(10)+1;
while(n!=0)
{
r=n%10;
sum=sum+pow(r,count);
n=n/10;
}
if(sum==t)
{
printf("is a narcissistic number");
}
else
{
printf("is not a narcissistic number");
}
}

Digit Sum Calculator:

#include <stdio.h>
int main() {
int n,i,sum=0,r,value=0;
printf("enter the number:");
scanf("%d",&n);
while(n!=0)
{
r=n%10;
if(r%2==0)
{
sum=sum+r;
}
else if(r!=0)
{
value=value+r;
}
n=n/10;
}
printf("the sum of even numbers: %d\n",sum);
printf("the sum of odd numbers: %d",value);
}

Finding the Next Palindrome

#include <stdio.h>
int main() {
int i,j,n,sum=0,count=0,r;
printf("enter the number:");
scanf("%d",&n);
for(j=n;count<1;j++)
{
sum=0;
i=j;
while(i!=0)
{
r=i%10;
sum=sum*10+r;
i=i/10;
}
if(j==sum)
{
printf("%d",sum);
 count++;
}
}
}

Finding Consecutive Palindromic Numbers

#include <stdio.h>
int main() {
int i,j,n,sum=0,count=0,r;
printf("enter the number:");
scanf("%d",&n);
for(j=n;count<5;j++)
{
sum=0;
i=j;
while(i!=0)
{
r=i%10;
sum=sum*10+r;
i=i/10;
}
if(j==sum)
{
printf("%d ",sum);
count++;
}
}
}

Generating Palindromic Right-Angled Triangle

#include <stdio.h>
int main() {
int n,n1=1,n2=0,i,j,count=0;
printf("enter the range:");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
count=0;
for(j=1;j<=i;j++)
 {
printf("%d ",n1++);
count++;
n2=n1-1;
}
for(int k=1;k<count;k++)
{
printf("%d ",--n2);
}
printf("\n");
}
}
The Palindromic Sum

#include <stdio.h>
int main() {
int temp,j,n,sum=0,add=0,r;
printf("enter the number:");
scanf("%d",&n);
for(j=1;j<=n;j++)
{
temp=j;
while(temp!=0)
{
r=temp%10;
sum=sum*10+r;
temp=temp/10;
}
if(j==sum)
{
add=add+sum;
}
sum=0;
}
printf("%d",add);
}

Pattern printing with multiples of 5

#include <stdio.h>
int main() {
 int i,k,j,n;
printf("enter the number:");
scanf("%d",&n);
for(i=0;i<=n;i++)
{
for(j=1;j<=i;j++)
{
printf("%d ",j*5);
}
printf("\n");
}
}

Squares of Even Numbers & odd number Series:

#include <stdio.h>
int main() {
int n,i,j,sum=0,value=0;
printf("enter the range:");
scanf("%d",&n);
if(n%2==0)
{
for(i=1;i<=n;i++)
{
if(i%2==0)
{
sum=i*i;
printf("%d ",sum);
}
}
}
else if(n%2!=0)
{
for(j=1;j<=n;j++)
{
if(j%2!=0)
{
value=j*j;
printf("%d ",value);
}
}
 }
}

Prime Pattern:

#include <stdio.h>
int main() {
int i,k,j,n;
printf("enter the number:");
scanf("%d",&n);
for(i=2;i<=n;i++)
{
int count=0;
for(j=2;j<i;j++)
{
if(i%j==0)
{
count++;
break;
}
}
if(count==0)
{
for(k=1;k<=i;k++)
{
printf("* ");
}
printf("\n");
}
}
}

LCM Finder :

#include <stdio.h>
int main() {
int n1,n2,max;
printf("enter the first numbers:");
scanf("%d",&n1);
printf("enter the second numbers:");
scanf("%d",&n2);
 if(n1<0 || n2<0 || n1==0 || n2==0)
printf("invalid");
else
{
max=(n1>n2)? n1: n2;
while((max%n1!=0) || (max%n2!=0))
{
max++;
}
printf("%d",max);
}
}

The Perfect Number Detective:

#include <stdio.h>
int main() {
int n,i,sum=0;
printf("enter the number:");
scanf("%d",&n);
int t=n;
for(int i=1;i<n;i++)
{
if(n%i==0)
{
sum=sum+i;
}
}
if(sum==t)
{
printf("\ngreatest divisor is : %d",sum/2);
}
else if(sum!=t)
{
printf("\n%d",t);
}
}

Handshake Simulation Program:

#include <stdio.h>
int main() {
int n,i,sum=0;
printf("enter the number:");
scanf("%d",&n);
for(int i=1;i<n;i++)
{
sum=sum+i;
}
printf("%d",sum);
}

Digit Summation

#include <stdio.h>
int main() {
int i,sum=0,n;
printf("enter the number:");
scanf("%d",&n);
while(n>9)
{
sum=0;
while(n!=0)
{
int r=n%10;
sum=sum+r;
n=n/10;
}
n=sum;
}
printf("%d",sum);
}

Digit Incrementer

#include <stdio.h>
int main() {
int n,result=0,place=1,digit;
scanf("%d",&n);
while(n!=0)
{
digit=n%10;
 digit=(digit+1)%10;
result=result+digit*place;
place=place*10;
n/=10;

}
printf("%d",result);
}

Printing Pattern in Reverse Order

#include <stdio.h>
int main() {
int i,n,num=1;
scanf("%d",&n);
for(i=0;i<=n;i++)
{
for(int j=1;j<=n-i;j++)
{
printf("%d ",j);

}
printf("\n");
}
}

OR

#include <stdio.h>
int main() {
int i,sum=0,n,j;
printf("enter the number:");
scanf("%d",&n);
for(i=0;i<=n;i++)
{
for(j=0;j<n-i;j++)
{
printf("%d ",j+1);
}
printf("\n");
}
}

The Odd Factorial Quest

#include <stdio.h>
int main() {
int i,n,sum=1;
scanf("%d",&n);
if(n%2!=0)
{
for(i=1;i<=n;i++)
{
if(i%2!=0)
{
sum=sum*i;
}
}
printf("%d ",sum);
}
else if(n%2==0)
{
printf("invalid");
}
}

Fibonacci Even Number Generator

#include <stdio.h>
int main() {
int i,n,t1=0,t2=1,nextterm;
scanf("%d",&n);
while(t1<=n)
{
if(t1%2==0)
{
printf("%d ",t1);
}
nextterm=t1+t2;
t1=t2;
t2=nextterm;
}
}

Exploring the Growth Series

#include <stdio.h>
int main() {
int i,n,range;
scanf("%d %d",&n,&range);
for(i=0;i<range;i++)
{
int nextterm=n;
printf("%d ",n);
n=nextterm*2;
}
}

Sum of all Prime Factors

int main()
{
int i, j, n, isPrime,sum=0;
printf("Enter any number to print Prime factors: ");
scanf("%d", &n);
for(i=2; i<=n; i++)
{
if(n%i==0)
{
for(j=2; j<=i; j++)
{
if(i%j==0)
{
break;
}
}
if(i==j)
{
sum=sum+i;
printf("%d, ", i);
}
}
}
 printf("%d",sum);
}

#include <stdio.h>

int main() {
int num, sum = 0;
printf("Enter a number: ");
scanf("%d", &num);
for (int i = 2; num > 1; ) {
if (num % i == 0) {
bool isPrime = true;
for (int j = 2; j * j <= i; j++) {
if (i % j == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
sum += i;
}
num /= i;
} else {
i++;
}
}
printf("Sum of prime factors: %d\n", sum);
return 0;
}

Sum N Odd Natural Numbers

#include <stdio.h>
#include<math.h>
int main() {
int n,i,sum=0;
scanf("%d",&n);
for(i=1;i<=n*2;i++)
{
if(i%2!=0)
 {
printf("%d ",i);
sum=sum+i;
}
}
printf("\n%d",sum);
}

Floyd's Triangle

#include <stdio.h>
#include<math.h>
int main() {
int n,s,r,count,num=1;
printf("enter the number:");
scanf("%d",&n);
for(int i=0;i<=n;i++)
{
for(int j=0;j<i;j++)
{
printf("%d ",num);
num++;
}
printf("\n");
}
}

Automorphic Number

#include <stdio.h>
#include<math.h>
int main() {
int n,s,r,count;
printf("enter the number:");
scanf("%d",&n);
int t=n;
s=n*n;
while(n!=0)
{
count++;
n=n/10;
 }
r=s%(int) (pow(10,count));
if(r==t)
printf("automorphic number");
else
printf("not a automorphic number");
}

Sum of First and Last digit:

#include <stdio.h>
#include<math.h>
int main() {
int n,i,r,rem;
printf("enter the number:");
scanf("%d",&n);
int t=n;
rem=n%10;
while(t!=0)
{
r=t%10;
t=t/10;
}
printf("%d",r+rem);
}

Sum of Even Numbers

#include <stdio.h>
#include<math.h>
int main() {
int n,i,sum=0,r,count=0,a;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
if(i%2==0)
{
sum=sum+i;
}
}
printf("%d",sum);
}

XOR Operations

#include <stdio.h>
#include<math.h>
int main() {
int n,i,count=0,a;
printf("enter the number:");
scanf("%d",&n);
for(i=n;n!=1;i++)
{
if(n%2==0)
{
a=n/2;
}
else if(n%2!=0)
{
a=n*3+1;
}
n=a;
count++;
}
printf("%d",count);
}

Sum of the Middle Digits

#include <stdio.h>
#include<math.h>
int main() {
int n,i,sum=0,r;
scanf("%d",&n);
i=n/10;
while(i>9)
{
r=i%10;
sum=sum+r;
i=i/10;
}
printf("%d",sum);
}

Reverse the digits

#include <stdio.h>
int main() {
int n,r,rev;
scanf("%d",&n);
while(n!=0)
{
r=n%10;
rev=rev*10+r;
n=n/10;
}
printf("%d",rev);
}

Alphabetical Pattern

#include <stdio.h>
int main() {
int n,sum=1,r;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
char a='A';
for(int j=1;j<=i;j++)
{
printf("%c ",a);
a++;
}
printf("\n");
}
}

Multiples of 5 - Pattern Printing

#include <stdio.h>
int main() {
int n,sum=1,r;
scanf("%d",&n);
 for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
printf("%d ",j*5);
}
printf("\n");
}
}

Product of N digits

#include <stdio.h>
int main() {
int n,sum=1,r;
scanf("%d",&n);
while(n!=0)
{
r=n%10;
sum=sum*r;
n=n/10;
}
printf("%d",sum);
}

Prime Number in range

#include <stdio.h>
int main() {
int n1,n2,i,j;
scanf("%d %d",&n1,&n2);
for(i=n1;i<=n2;i++)
{
for(j=2;j<=n2;j++)
{
if(i%j==0)
{
break;
}
}
if(i==j)
 printf("%d ",i);
}
}

Harshad Number

#include <stdio.h>
int main() {
int n,t,sum=0,r;
printf("enter the number:");
scanf("%d",&n);
t=n;
while(n!=0)
{
r=n%10;
sum=sum+r;
n=n/10;
}
if(t%sum==0)
printf("harshad number");
else
printf("not harshad number");
}

Strong Number:

#include <stdio.h>
int main() {
int i,n,r,f=1,sum=0;
scanf("%d",&n);
int t=n;
for(i=n;n!=0;i++)
{
r=n%10;
f=1;
for(int j=1;j<=r;j++)
{
f=f*j;
}
sum=sum+f;
n=n/10;
 }
if(t==sum)
printf("strong number");
else
printf("not a strong number");
}

Palindrome Check

#include <stdio.h>
int main() {
int n,r,rev;
scanf("%d",&n);
int t=n;
while(n!=0)
{
r=n%10;
rev=rev*10+r;
n=n/10;
}
if(t==rev)
printf("palindrome");
else
printf("not a palindrome");
}

Concept of lcm and hcf:

#include<stdio.h>
int main()
{
int n,m,gcd,i;
scanf("%d %d",&n,&m);
for(int i=1;i<=n && i<=m;i++)
{
if(n%i==0&&m%i==0)
{
gcd=i;
}
}
int lcm=(n*m)/gcd;
 printf("%d\n",gcd);
printf("%d",lcm);
}