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: Runtime Error)

# frozen_string_literal: true

N = gets.to_i
if(N < 10)
    puts "Yes"
end
if(N < 100 && N >= 10) 
 a = (N % 10) + (N / 10)
elsif(N >= 100 && N < 1000)
 a = (N / 100) + ((N % 100) / 10) + (N % 10)
elsif(N >= 1000 && N < 10_000)
 a = (N / 1000) + (N % 1000) / 100 + (N % 100) / 10 + (N % 10)
elsif(N >= 10_000 && N < 100_000)
 a = (N / 100_000) + (N % 10_000) / 1000 + (N % 1000) / 100 + (N % 100) / 10 + (N % 10)
elsif(N >= 100_000 && N < 1_000_000)
 a = (N / 100_000) + (N % 100_000) / 10_000 + (N % 10_000) / 1_000 + (N % 1_000) / 100 + (N % 100) / 10 + (N % 10)
 elsif(N / 1_000_000 && N < 10_000_000)
 a = (N / 1_000_000) + (N % 1_000_000) / 100_000 + (N % 100_000) / 10_000 + (N % 10_000) / 1000 + (N % 1_000) / 100 + (N % 100) / 10 + (N % 10)
 elsif(N >= 10_000_000 && N < 100_000_000)
 a = (N / 10_000_000) + (N % 10_000_000) / 1_000_000 + (N % 1_000_000) / 100_000 + (N % 100_000) / 10_000 + (N % 10_000) / 1_000 + (N % 1_000) / 100 + (N % 100) / 10 + (N % 10)
 elsif(N == 100_000_000)
    a = 1
end
if N % a == 0 && N >= 10
    puts "Yes"
elsif N % a != 0 && N >= 10
    puts "No"
end
end
if N % a == 0
    puts "Yes"
elsif N % a != 0
    puts "No"
end