Easy 0 solved 0% acceptance

Harshad Number

Check whether a number is divisible by the sum of its digits (a Harshad or Niven number).

What you'll learn

  • Compute a digit sum with a loop
  • Use the remainder operator to test divisibility
  • Keep the original value while consuming digits

Problem

A Harshad number (also called a Niven number) is a positive integer that is divisible by the sum of its own digits. For example, 18 has digit sum 1 + 8 = 9, and 18 ÷ 9 = 2 with no remainder, so 18 is a Harshad number.

Implement harshad_number(n).

Input

n: The number to test.

Output

Return true if n is divisible by the sum of its decimal digits, otherwise false.

Constraints

1 ≤ n ≤ 10^18

Examples

Example 1
Input:
n = 156

Expected output:
expected = True
Input:
long long n = 156;

Expected output:
bool expected = true;
Input:
long n = 156;

Expected output:
bool expected = true;

Explanation

The digit sum is 1 + 5 + 6 = 12, and 156 = 12 × 13, so the answer is true.

Example 2
Input:
n = 19

Expected output:
expected = False
Input:
long long n = 19;

Expected output:
bool expected = false;
Input:
long n = 19;

Expected output:
bool expected = false;

Explanation

The digit sum is 1 + 9 = 10, and 19 is not a multiple of 10, so the answer is false.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Add up the digits first, using a copy of n.

Hint 2

n is Harshad when the remainder of n divided by the digit sum is 0.

Hint 3

The digit sum of a positive number is never 0, so the division is safe.

Expected complexity

O(d) time for d digits, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.