Scribd
Upload
2 views21 pages

C program basic

The document contains multiple C programming code snippets that implement various mathematical and number-related algorithms. These include functions for determining leap years, calculating GCD, checking for prime numbers, generating Fibonacci series, and converting between number bases. Each code snippet is structured to read input, perform calculations, and print results based on specific conditions.

Uploaded by

fairlin.adrina
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views21 pages

C program basic

The document contains multiple C programming code snippets that implement various mathematical and number-related algorithms. These include functions for determining leap years, calculating GCD, checking for prime numbers, generating Fibonacci series, and converting between number bases. Each code snippet is structured to read input, perform calculations, and print results based on specific conditions.

Uploaded by

fairlin.adrina
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

1)LEAP YEAR

#include <stdio.h>

void main()

{ int n;

scanf("%d",&n);

if (n%4==0 && n%100!=0 || n%400==0)

printf("Leap Year");

else

printf("No");

2)GCD
#include <stdio.h>

void main()

int a,b;

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

while (b!=0)

int temp=b;

b=a%b;

a=temp;

printf("%d",a);

}
PRIME NUMBER
#include <stdio.h>

int main() {

int n, i, prime = 1;

printf("Enter number: ");

scanf("%d", &n);

if (n <= 1)

prime = 0;

else {

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

if (n % i == 0) {

prime = 0;

break;

if (prime)

printf("Prime Number");

else

printf("Not Prime Number");

return 0;

}
PRIME NUMBERS WITHIN RANGE
#include <stdio.h>

int main() {

int n1, n2, i, j, prime;

printf("Enter two numbers: ");

scanf("%d%d", &n1, &n2);

for (i = n1; i <= n2; i++) {

if (i <= 1)

continue;

prime = 1;

for (j = 2; j * j <= i; j++) {

if (i % j == 0) {

prime = 0;

break;

if (prime)

printf("%d ", i);

return 0;

}
SUM OF DIGITS
#include <stdio.h>

int main() {

int n, sum = 0;

printf("Enter number: ");

scanf("%d", &n);

while (n > 0) {

sum += n % 10;

n /= 10;

printf("Sum = %d", sum);

return 0;

REVERSE OF A NUMBER
#include <stdio.h>

int main() {

int n, rev = 0;

printf("Enter number: ");

scanf("%d", &n);
while (n > 0) {

rev = rev * 10 + n % 10;

n /= 10;

printf("Reverse = %d", rev);

return 0;

ARMSTRONG NUMBER
#include <stdio.h>

#include <math.h>

int main() {

int n, temp, digits = 0, rem;

int sum = 0;

printf("Enter number: ");

scanf("%d", &n);

temp = n;

while (temp > 0) {

digits++;

temp /= 10;

}
temp = n;

while (temp > 0) {

rem = temp % 10;

sum += pow(rem, digits);

temp /= 10;

if (sum == n)

printf("Armstrong Number");

else

printf("Not Armstrong Number");

return 0;

FIBONACCI SERIES
#include<stdio.h>

int main()

int n;

int a=0,b=1,c,i;

scanf("%d",&n);

if (n>=1)

printf("%d ",a);

}
if (n>=2)

printf("%d ",b);

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

c=a+b;

a=b;

b=c;

printf("%d ",c);

return 0;

FACTORIAL
#include <stdio.h>

int main()

int n,i;

long long fact=1;

scanf("%d",&n);

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

fact=fact*i;

printf("%lld",fact);

return 0;

}
POWER OF A NUMBER
#include <stdio.h>

#include <math.h>

int main()

int base,expo;

long long power;

scanf("%d %d",&base,&expo);

power=pow(base,expo);

printf("%lld",power);

return 0;

PRIME FACTORS
#include <stdio.h>

int main()

int n,i;

scanf("%d",&n);

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

while (n%i==0)

printf("%d ",i) ;

n=n/i;

return 0;

}
STRONG NUMBER
#include <stdio.h>

int main()

int n,i,rem,sum=0;

scanf("%d",&n);

int temp=n;

while (temp>0)

rem=temp%10;

int fact=1;

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

fact=fact*i;

temp=temp/10;

sum=sum+fact;

if (sum==n)

printf("Strong number");

else

printf("Not a Strong Number");

return 0;

}
PERFECT NUMBER
#include <stdio.h>

int main()

int n,i,sum=0;

scanf("%d",&n);

int temp=n;

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

if (temp%i==0)

sum=sum+i;

if (temp==sum)

printf("Perfect Number");

else

printf("Not a Perfect Number");

return 0;

PERFECT SQUARE
#include <stdio.h>
int main()

int n,i,flag=0;

scanf("%d",&n);

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

if (i*i==n)

flag=1;

if (flag==0)

printf("%d is not a perfect square",n);

else

printf("%d is a perfect square",n);

return 0;

AUTOMORPHIC NUMBER
#include <stdio.h>

int main()
{

int n,i,flag=0,digits=1;

scanf("%d",&n);

int s=n*n;

int temp=n;

while (temp>0)

digits=digits*10;

temp=temp/10;

int last=s%(digits);

if (last==n)

printf("Automorphic number");

else

printf("Not an Automorphic number");

return 0;

HARSHAD OR NIVEN NUMBER


#include <stdio.h>

int main()

{
int n,rem,sum=0;

scanf("%d",&n);

int temp=n;

while (temp>0)

rem=temp%10;

sum=sum+rem;

temp/=10;

if(n>0 && n%sum==0)

printf("Harshad number");

else

printf("Not a harshad number");

return 0;

ABUNDANT NUMBER
#include <stdio.h>

int main()

int n,sum=0,i;
scanf("%d",&n);

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

if (n%i==0)

sum=sum+i;

if (sum>n)

printf("Abundant number");

else

printf("Not an Abundant number");

return 0;

FRIENDLY PAIR
#include <stdio.h>

int main()

int n1,n2,sum1=0,i,sum2=0;

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

if (n1%i==0)

sum1=sum1+i;

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

if (n2%i==0)

sum2=sum2+i;

if (sum1*n2==sum2*n1)

printf("FRIENDLY PAIR");

else

printf("Not a FRIENDLY PAIR");

return 0;

GCD/HCF(Euclid's Algorithm)
#include <stdio.h>

int main()

int a,b,rem;

scanf("%d %d",&a,&b);
while (b!=0)

rem=a%b;

a=b;

b=rem;

printf("%d",a);

return 0;

GCD/HCF
#include <stdio.h>

int main()

int a,b,hcf=1,i;

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

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

if (a%i==0 && b%i==0)

hcf=i;

printf("%d",hcf);

return 0;

LCM
#include <stdio.h>
int main()

int a,b,hcf=1,i,lcm=1;

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

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

if (a%i==0 && b%i==0)

hcf=i;

lcm=(a/hcf)*b;

printf("%d",lcm);

return 0;

Binary to Decimal
#include <stdio.h>

int main()

int binary,decimal=0,base=1,rem;

scanf("%d",&binary);

while (binary>0)

rem=binary%10;

decimal+=base*rem;

base*=2;

binary/=10;

printf("%d",decimal);
}

Octal to Decimal
#include <stdio.h>

int main()

int octal,decimal=0,base=1,rem;

scanf("%d",&octal);

while (octal>0)

rem=octal%10;

decimal+=base*rem;

base*=8;

octal/=10;

printf("%d",decimal);

Hexadecimal to Decimal
#include <stdio.h>

int main()

char hex[20];

int decimal=0,i=0,value;

scanf("%s",hex);

while (hex[i]!='\0')

if (hex[i]>='0' && hex[i]<='9')

value=hex[i]-'0';

else if(hex[i]>='A' && hex[i]<='F')

{
value=hex[i]-'A'+10;

else if(hex[i]>='a' && hex[i]<='f')

value=hex[i]-'a'+10;

decimal=decimal*16+value;

i++;

printf("%d",decimal);

return 0;

DECIMAL TO BINARY
#include <stdio.h>

int main()

int n,i=0,j,bin[32];

scanf("%d",&n);

if (n==0)

printf("0");

return 0;

while (n>0)

bin[i]=n%2;

n/=2;

i++;

for (j=i-1;j>=0;j--)
{

printf("%d",bin[j]);

return 0;

Decimal to Hexadecimal
#include <stdio.h>

int main()

int n,i=0,j,rem;

char hex[32];

scanf("%d",&n);

if (n==0)

printf("0");

return 0;

while (n>0)

rem=n%16;

if (rem<10)

hex[i]=rem+'0';

else

hex[i]=rem-10+'A';

n/=16;
i++;

for (j=i-1;j>=0;j--)

printf("%c",hex[j]);

return 0;

You might also like