Skip to main content

Find Armstrong Number in C

Finding Armstrong number is again a great exercise for students The exercise involves clever use of modulus operator to extract the digits and then using those digits to perform calculations.

Armstrong Number : These are the special numbers which is equal to the sum of the cube of their own digits.
like 153. since 153= 13+53+33=1+125+27=153 cool isn't it. So how can you find them? Here is the logic.
Logic: use modulus operator to get the last digit of the number. so 153%10=3 (last digit). cube this number, 3*3*3=27, then save it to a variable. again now reduce the number 153. 153/10=15 (see the last digit will be removed :) ). repeat the process till this number becomes 0.
Code:

#include<stdio.h>

int armstrong(int x)
{
    //copy x to k
    int k=x;
    
    //start extracting its digit, 
    // cube the digit and start saving it
    // we will use sum to save the total.
    int sum=0;
    int r=0;
    //r will be used for remainder
    while(k>0)
    {
        r=k%10;
        //now cude the remainder and add it to sum
        sum+=r*r*r;
        //reduce k by 10
        k=k/10;    
    }
    if(x==sum)
    {
        return(1);
    }
    else
    {
        return(0);
    }
}

int main()
{
    int k=0;
    //n will be used how far we want to calculate
    int n;
    printf("\n Enter a number=");
    scanf("%d",&n);
    for(k=0;k<=n;k++)
    {
        if(armstrong(k))
        {
            printf("\n Armstring number=%d",k);
        }
    }
    
}

Popular posts from this blog

calculating leap year in c using if else

Most new students get really confused when it comes to calculating Leap year in C. It is given as an exercise to enhance their knowledge about using if else usages. This can be calculated using Logical operators too. But using if else provides clearer ways to calculate it. Both of the methods can be implemented in C/C++ program. Here we will discuss the if else method in C/C++

Find nth Prime Number in C++

c++ program to find prime numbers: The problem of finding prime number can be solved by checking all numbers, testing them for prime and then moving ahead. If you want to calculate nth prime. Then this can be done in a brutal way by checking the number one by one. This may sound odd, by there is no easy way then this  for prime numbers (Well Actually there are like Pollard's Rho Algorithm, Number Sieves or Shor's Quantum Algorithm, but we are talking about the one that most people may understand easily). There may be way to pre-calculate the prime numbers but that again is not sufficient. So how can we use c++ to create a program to find prime numbers.