IP-16.c ​
Metadata ​
- Author — Amit Dutta
- Last updated — 03 Jan 2026
- License — MIT License (See the LICENSE file for details)
Problem Statement ​
Problem Statement
Write a C program that includes a user-defined function named isArmstrong with the signature int isArmstrong(int num);. An Armstrong number is a number that is equal to the sum of its own digits each raised to the power of the number of digits. For example, 153 is an Armstrong number because 1^3 + 5^3 + 3^3 = 153
Source Code ​
Printing the code
To print this file, open it on GitHub and click Raw before printing, or use the Download Raw button above and print directly from that page.
c
#include <stdio.h>
#include <math.h>
int isArmstrong(int);
int count(int);
int main()
{
int n;
printf("Enter the number: ");
scanf("%d", &n);
if (isArmstrong(n))
{
printf("\nInput %d is a Armstrong Number.", n);
}
else
{
printf("\nInput %d is Not a Armstrong Number.", n);
}
return 0;
}
int count(int n)
{
int count = 0;
while (n > 0)
{
count++;
n = n / 10;
}
return count;
}
int isArmstrong(int n)
{
if (n < 0)
return 0;
if (n == 0)
return 1;
int power = count(n);
int temp = n;
int checker = 0;
while (temp > 0)
{
int digit = temp % 10;
checker = checker + (int)round(pow(digit, power));
temp = temp / 10;
}
return n == checker;
}1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54