Skip to main content

How to find the number is Harshad number or not in C

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>
int main()
{
     //To initialize of variable
     int number,temp,sum = 0, digit, res;
    printf("enter any number : "); 
    scanf("%d",&number);

    //store in temporary variable
    temp = number;
   //use while loop with this condition
   while(temp!=0)
   {
       //to find last digit
        digit=temp % 10;
      //sum+=digit
        sum = sum + digit;
     //temp/=10
        temp = temp / 10;
   }
   res = number % sum;
   //check result is equal is to 0
   if(res == 0)
      //display
       printf("%d is Harshad Number",number);
   else
      //display
      printf("%d is not Harshad Number",number);
  return 0;



OUTPUT:-





FOLLOW AND SUBSCRIBE THIS WEBPAGE FOR 
 MORE NEW PROGRAMS AND CODING SOLUTIONS.
👈👈👈😉😉😉😉😉😉😉😉😉

Comments

Popular posts from this blog

Data Structure Multiple Choice Questions and Answers

  Data Structure Multiple Choice Questions and Answers Our 1000+ multiple choice questions and answers (MCQs) on "Data Structure - I" (along with 1000+ MCQs on "Data Structure - II (Algorithms)") focus on all areas of Data Structure covering 200+ topics. One can read MCQs on Data Structure - II (Algorithms)                 Array and Array Operations This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Array and Array Operations”. 1. Which of these best describes an array? a) A data structure that shows a hierarchical behavior b) Container of objects of similar types c) Arrays are immutable once initialised d) Array is not a data structure View Answer Answer: b Explanation: Array contains elements only of the same type. 2. How do you initialize an array in C? a) int arr[3] = (1,2,3); b) int arr(3) = {1,2,3}; c) int arr[3] = {1,2,3}; d) int arr(3) = (1,2,3); View Answer Answer: c Explanation: This is the syntax ...

sWAP cASE

  sWAP cASE: You are given a string and your task is to  swap cases . In other words, convert all lowercase letters to uppercase letters and vice versa. For Example: Www.HackerRank.com → wWW.hACKERrANK.COM Pythonist 2 → pYTHONIST 2 Function Description Complete the  swap_case  function in the editor below. swap_case  has the following parameters: string s:  the string to modify Returns string:  the modified string Input Format A single line containing a string  . Sample Input 0 HackerRank.com presents "Pythonist 2". Sample Output 0 hACKERrANK.COM PRESENTS "pYTHONIST 2". def   swap_case ( s ):      result =  s . swapcase ()      return ( result ) if  __ name__  ==  '__main__' :      s  =  input ()      result  =  swap_case ( s )      print ( result )

Chakra Vyuh Bhedna, the only answer to how to crack group discussions!

  Chakra Vyuh Bhedna, the only answer to how to crack group discussions! Because of the pandemic, the placement drive was conducted virtually. And to add to the difficulty level, more than 200 students participated in the drive. The selection process consisted of an online test that included the aptitude and technical questions, which was followed by a group discussion. Both were elimination rounds. The shortlisted students were then called for the final round, the personal interview. All about cracking group discussions and interviews My strategy was to be attentive in the pre-placement talks by asking questions to them and even trying to answer their questions. This helped me to boost my self-confidence and made me perform well during the Group Discussion. For cracking group discussion, I practiced a simple and powerful technique called  Chakra Vyuh Bhedna . It's a complete weapon to crack any GD. This technique has 4 parts.  Awareness of the topic Understanding PE...