Code_with_chandan

 Write' The First Program' Hello World in C:- CODE:- #include <stdio.h> int  main() {     printf( " hellow world" );      return   0 ; } OUTPUT:- FOLLOW THIS WEBPAGE FOR MORE NEW PROGRAMS AND CODING SOLUTIONS.

How to find the number is Harshad number or not in C:- In this program we will discuss of a number is a Harshad number or not in C programming. In mathematics, a Harshad number is a number that is divisible by the sum of its digits. We use a while loop statement with the following conditions. Input consists of 1 integer. ALGORITHMS:- Step 1 - Enter the number to be check. Step 2 - store the number in a temporary variable. Step 3 - Initialise the while loop until the temp is not equal to zero      (i) Calculate the remainder of the temp, divided with the 10 and store in digit      (ii)  add the digit with sum and store it in the sum.      (ii) divide the temp with the 10 and store in the temp; Step 4 - find the modulus of the number with sum and store in the res; Step 5 - if res equal to zero then a given number is a Harshad number else the given number is not a Harshad number. Step 6 - Stop.     Code:- #include <stdio.h...

  Write a C program to find the number is an Abundant number or not:- In this program to find a number is an Abundant number or not. A number n is said to be an Abundant Number to follow these condition the sum of its proper di visors is greater than the number itself. And the difference between these two values is called abundance. Ex:-  Abundant number  12 having a proper divisor is 1,2,3,4,6 the sum of these factors is 16 it is greater than 12 so it is an Abundant number. Some other abundant numbers     18, 20, 24, 30, 36, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120.. ALGORITHMS:- Step 1 - Enter the number, to find the Abundant number. Step 2 - Initialize the loop with c=1 to c<=number and follow the following calculation      (i) check if whether the number is divisible with c and c got a result zero.      (ii) now sum=sum+c, add a digit into a sum and store it in the sum. Step 3 . then the...