jbiason
/
exercism
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Responses for exercises in Exercism.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
55 Commits
1 Branch
0 Tags
2.2 MiB
 
 
 
 
 
 
Tree: 940d9319fc
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '940d9319fc'
${ noResults }
exercism/c/armstrong-numbers
Julio Biason 785682190a
Make a single test framework 		3 years ago
..
.exercism Exercism: Armstrong numbers 3 years ago
HELP.md Exercism: Armstrong numbers 3 years ago
README.md Exercism: Armstrong numbers 3 years ago
armstrong_numbers.c Exercism: Armstrong numbers 3 years ago
armstrong_numbers.h Exercism: Armstrong numbers 3 years ago
makefile Exercism: Armstrong numbers 3 years ago
test-framework Make a single test framework 3 years ago
test_armstrong_numbers.c Exercism: Armstrong numbers 3 years ago
tests.out Exercism: Armstrong numbers 3 years ago

README.md

Armstrong Numbers

Welcome to Armstrong Numbers on Exercism's C Track. If you need help running the tests or submitting your code, check out HELP.md.

Instructions

An Armstrong number is a number that is the sum of its own digits each raised to the power of the number of digits.

For example:

  • 9 is an Armstrong number, because 9 = 9^1 = 9
  • 10 is not an Armstrong number, because 10 != 1^2 + 0^2 = 1
  • 153 is an Armstrong number, because: 153 = 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153
  • 154 is not an Armstrong number, because: 154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190

Write some code to determine whether a number is an Armstrong number.

Source

Created by

Contributed to by

Based on

Wikipedia - https://en.wikipedia.org/wiki/Narcissistic_number