May 27, 20230
C Program to Generate Multiplication Table of 1 to 10
#include<stdio.h> #include<conio.h> int main() { int i, j, product; clrscr(); /* Generating Multiplication Table */ for(i=1;i<=10;i++) { for(j=1;j<=10;j++) { product = i*j; printf(“%d x %d = %d\t”, i, j, product); } printf(“\n”); } getch(); return(0); } Output 1 x 1 = 1 1 x 2 = 2 1 x 3 = 3 1 x 4…
May 26, 20230
C Program to Read a Number and Displaying Its Digit in Words
#include<stdio.h> #include<conio.h> int main() { long int number, rem, reverse=0; clrscr(); printf(“Enter number: “); scanf(“%ld”, &number); /* Reversing number */ while(number!=0) { rem = number%10; reverse = reverse * 10 + rem; number = number/10; } /* Printing Each digits in words */ while(reverse != 0) { rem = reverse%10; switch(rem) { case 0: printf(“Zero…
May 26, 20230
C Program to Find Sum of First Digit and Last Digit of a Number
#include<stdio.h> #include<conio.h> int main() { long number, firstDigit, lastDigit, sum; clrscr(); printf(“Enter any number: “); scanf(“%ld”, &number); /* Finding last digit */ lastDigit = number%10; /* Finding first digit */ while(number>9) { number = number/10; } firstDigit = number; /* Finding sum */ sum = firstDigit + lastDigit; /* Displaying result */ printf(“Sum of first…
May 26, 20230
C Program to Read a Number and Displaying Its Digit in Words in Reverse Order
#include #include int main() { long int number, rem; clrscr(); printf(“Enter number: “); scanf(“%ld”, &number); /* Printing Each digits in words */ while(number != 0) { rem = number%10; switch(rem) { case 0: printf(“Zero “); break; case 1: printf(“One “); break; case 2: printf(“Two “); break; case 3: printf(“Three “); break; case 4: printf(“Four “);…
May 26, 20230
C Program to Calculate Value of PI using Leibniz Formula
#include<stdio.h> #include<conio.h> #include<math.h> int main() { long int i, n; double sum=0.0, term, pi; printf(“Enter number of terms: “); scanf(“%ld”, &n); /* Applying Leibniz Formula */ for(i=0;i< n;i++) { term = pow(-1, i) / (2*i+1); sum += term; } pi = 4 * sum; printf(“\nPI = %.6lf”, pi); return 0; } Output Enter number of…
May 26, 20230
C Program to Check Whether a Number is Triangular or Not
#include<stdio.h> #include<conio.h> int main() { int number, i, sum=0; clrscr(); printf(“Enter number: “); scanf(“%d”, &number); for(i=0;i < number; i++) { sum = sum+i; if(sum == number) { printf(“%d is TRIANGULAR NUMBER.”, number); break; } } if(number == i) { printf(“%d is NOT TRIANGULAR NUMBER.”, number); } getch(); return(0); } Output  Run 1: ———— Enter number:…
May 26, 20230
C Program to Generate Perfect Numbers in Given Minimum to Maximum Ranges
#include<stdio.h> #include<conio.h> int main() { int minimum, maximum, sum, i, j; clrscr(); printf(“Enter minimum: “); scanf(“%d”, &minimum); printf(“%Enter maximum: “); scanf(“%d”, &maximum); /* Generating Perfect Numbers */ for(i=minimum; i<=maximum; i++) { /* Finding Sum of All Divisors */ sum = 0; for(j=1;j< i;j++) { if(i%j==0) { sum = sum + j; } } /* Making…
May 26, 20230
C Program to Check Co-Prime Numbers
#include<stdio.h> #include<conio.h> int main() { int num1, num2, hcf, i; clrscr(); printf(“Enter two numbers:\n”); scanf(“%d%d”, &num1, &num2); // Finding HCF for(i=1;i<=num1;i++) { if(num1%i==0 && num2%i==0) { hcf = i; } } // Making Decision if(hcf == 1) { printf(“%d and %d are CO-PRIME NUMBERS.”, num1, num2); } else { printf(“%d and %d are NOT CO-PRIME…
May 26, 20230
C Program to Generate Prime Numbers in Given Minimum to Maximum Ranges
#include<stdio.h> #include<conio.h> int main() { int minimum, maximum, flag, i, j; clrscr(); /* Inputs */ printf(“Enter minimum number: “); scanf(“%d”, &minimum); printf(“Enter maximum number: “); scanf(“%d”, &maximum); /* Generating prime numbers */ for(i=minimum; i<=maximum; i++) { flag = 0; for(j=2; j <= i/2; j++) { if(i%j==0) { flag=1; break; } } if(flag==0 && i>=2) {…
May 26, 20230
C Program to Generate First N Armstrong Numbers Where N is Given by User
#include<stdio.h> #include<conio.h> #include<math.h> int main() { int n, digitCount, number, sum, rem, i=2, count=1; clrscr(); printf(“Enter how many Armstrong numbers? \n”); scanf(“%d”, &n); /* Generating Armstrong Numbers */ while(count <= n) { /* Finding number of digits */ number = i; digitCount = 0; while(number != 0) { digitCount++; number = number/10; } /* Finding…
May 26, 20230
C Program to Check Strong Number
#include<stdio.h> int main() { int number, original, rem, sum=0, fact, i; printf(“Enter number: “); scanf(“%d”, &number); original = number; /* Finding sum */ while(number != 0) { rem = number%10; /* Finding Factorial */ fact = 1; for(i=1; i<=rem; i++) { fact = fact*i; } sum = sum + fact; number = number/10; } /*…
May 26, 20230
C Program to Generate Armstrong Numbers in Given Minimum to Maximum Ranges
#include<stdio.h> #include<conio.h> #include<math.h> int main() { int minimum, maximum, digitCount, number, sum, rem, i; clrscr(); printf(“Enter minimum number: “); scanf(“%d”, &minimum); printf(“Enter maximum number: “); scanf(“%d”, &maximum); for(i=minimum; i<=maximum; i++) { /* Finding number of digits */ number = i; digitCount = 0; while(number != 0) { digitCount++; number = number/10; } /* Finding sum…
May 26, 20230
C Program to Generate Strong Numbers in an Interval
#include<stdio.h> #include<conio.h> int main() { long int minimum, maximum, number, sum, fact, rem, i, j; clrscr(); printf(“Enter minimum: “); scanf(“%ld”, &minimum); printf(“Enter maximum: “); scanf(“%ld”, &maximum); /* Generating Strong Numbers */ for(i=minimum; i<=maximum; i++) { number = i; sum = 0; while(number != 0) { rem = number%10; /* Finding Factorial */ fact = 1;…
May 26, 20230
C Program to Generate First N Prime Numbers Where N is Given by User
#include<stdio.h> #include<conio.h> int main() { int n, count=1, flag, i=2, j; clrscr(); printf(“Enter how many prime numbers? \n”); scanf(“%d”, &n); /* Generating prime numbers */ while(count <= n) { flag = 0; for(j=2; j <= i/2; j++) { if(i%j==0) { flag=1; break; } } if(flag==0) { printf(“%d\t”,i); count++; } i++; } getch(); return(0); } Output …
May 26, 20230
C Program to Check Whether a Given Number is Palindrome Number or Not
#include<stdio.h> #include<conio.h> int main() { long int number, reverse=0, rem, original; clrscr(); printf(“Enter number: “); scanf(“%ld”, &number); original = number; // Finding Reverse while(number!=0) { rem = number % 10; reverse = reverse*10 + rem; number = number/10; } // Checking for Palindrome if(original == reverse) { printf(“%ld is PALINDROME.”, original); } else { printf(“%ld…
May 26, 20230
C Program to Generate First 50 Prime Numbers
#include<stdio.h> #include<conio.h> int main() { int count=1, flag, i=2, j; clrscr(); /* Generating prime numbers */ printf(“First 50 Prime Numbers Are: \n”); while(count <= 50) { flag = 0; for(j=2; j <= i/2; j++) { if(i%j==0) { flag=1; break; } } if(flag==0) { printf(“%d\t”,i); count++; } i++; } getch(); return(0); } Output First 50 Prime…
May 26, 20230
C Program to Find Reverse of a Given Number
#include<stdio.h> #include<conio.h> int main() { long int number, reverse=0, rem, original; clrscr(); printf(“Enter number: “); scanf(“%ld”, &number); original = number; while(number!=0) { rem = number % 10; reverse = reverse*10 + rem; number = number/10; } printf(“Reverse of %ld is %ld”, original, reverse); getch(); return(0); } Output Enter number: 67859 ↲ Reverse of 67859 is…
May 26, 20230
C Program to generate first n Fibonacci terms
#include<stdio.h> #include<conio.h> int main() { int n, a=0, b=1, next, i; clrscr(); printf(“Enter how many terms? “); scanf(“%d”, &n); printf(“First %d Fibonacci terms are: \n”, n); for(i=1;i<=n;i++) { printf(“%d\t”, a); next = a + b; a = b; b = next; } getch(); return(0); } Output Enter how many terms? 8 ↲ First 8 Fibonacci…
https://atozonlinesolutions.com/wp-content/uploads/2017/03/logo_white.png
https://atozonlinesolutions.com/wp-content/uploads/2017/03/logo_white.png
About
Products
Subscribe

If you wish to receive our latest news in your email box, just subscribe to our newsletter. We won’t spam you, we promise!

    Applauz

    As the pioneer of the lean startup movement, APPLAUZ has dedicated it’s time to sharing effective business strategies that help new businesses and enterpreneurs put their money to work in the right way.

    Subscribe

    If you wish to receive our latest news in your email box, just subscribe to our newsletter. We won’t spam you, we promise!

      Applauz

      As the pioneer of the lean startup movement, APPLAUZ has dedicated it’s time to sharing effective business strategies that help new businesses and enterpreneurs put their money to work in the right way.

      Copyright by BOLD THEMES. All rights reserved.