C PROGRAMMING PROGRAM • LOOPS & NUMBER PROBLEMS

Check Whether a Number Is an Armstrong Number

Learn how to check whether a number is an armstrong number using a clear C program.

IntermediateDigit countPowerArmstrong number

PROBLEM UNDERSTANDING

Input and expected output

Sample input
153
Sample output
Armstrong number

COMPLETE C PROGRAM

Complete C implementation

armstrong-number.c
Open in compiler
#include <stdio.h>

int main(void)
{
    int number, value, digits = 0, sum = 0;

    printf("Enter a non-negative integer: ");
    scanf("%d", &number);
    if (number < 0) {
        printf("Use a non-negative integer.\n");
        return 0;
    }
    value = number;
    do {
        digits++;
        value /= 10;
    } while (value > 0);
    value = number;
    do {
        int digit = value % 10;
        int power = 1;
        for (int count = 0; count < digits; count++) power *= digit;
        sum += power;
        value /= 10;
    } while (value > 0);
    printf(sum == number ? "Armstrong number\n" : "Not an Armstrong number\n");
    return 0;
}

GUIDED CODE TOUR • NOT LIVE EXECUTION

Study the program line by line

Use the real compiler button above to run and debug with different inputs.

CURRENT STEP

Select Start to walk through the important lines.

SELECTED LINE

No line selected

EXPECTED OUTPUT FOR THE SAMPLE

Armstrong number
0%Step 0 of 0

PROGRAM EXPLANATION

Algorithm and explanation

  1. Read the required input values.
  2. Count the digits, raise each digit to that count, add the powers and compare with the original.
  3. Display the computed result.

Count the digits, raise each digit to that count, add the powers and compare with the original.

EFFICIENCY

Time and space complexity

Time complexity

O(d²)

Auxiliary space

O(1)

DEBUGGING CHECKLIST

Common mistakes

Check this

Use the correct format specifier for every variable.

Check this

Initialize variables before using their values.

Check this

Check braces, semicolons and input order carefully.

Try it yourself

Practice: Run the program with the sample input, predict its output, and then test one boundary case of your own.