Problem:
Score : 200 points

Problem Statement

An integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.

Given an integer N, determine whether it is a Harshad number.

Constraints

1?N?10^8

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print Yes if N is a Harshad number; print No otherwise.

Sample Input 1

12

Sample Output 1

Yes

f(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.

Sample Input 2

57

Sample Output 2

No

f(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.

Sample Input 3

148

Sample Output 3

No

Solution in Ruby (2.3.3) (judge verdict: Accepted)

# n = gets.chomp.split('')
# n0=n=gets.to_i
# x=0
# (n.to_s.size).times do
#   x+=n%10
#   n/=10
# end
# puts n0%x==0 ? :Yes: :No
n = gets.to_i
f = n.to_s.chars.map(&:to_i).inject(&:+)
puts n%f == 0 ? "Yes" : "No"