The Harshad Hunter

The Joy-Giver

A Harshad Number is an integer divisible by the sum of its digits. Example: $18$ $ o 1 + 8 = 9 o 18$ is divisible by $9$.

The Assignment

Your function receives a parameter named num.

1. Preserve a copy of the original number.
2. Use a loop to calculate the sum of all digits in num.
3. After the loop, check if the original number is divisible by that sum.
4. Print "true" if it is, otherwise print "false".