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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.*;


public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] c = {0,0,0,0,0,0,0,0,0};

    c[ 8 ] =                   N / 100_000_000 ;
    c[ 7 ] = ( N % 100_000_000 ) / 10_000_000  ;
    c[ 6 ] = ( N % 100_000_00 )  / 10_000_00   ;
    c[ 5 ] = ( N % 100_000_0 )   / 10_000_0    ;
    c[ 4 ] = ( N % 100_000 )     / 10_000      ;
    c[ 3 ] = ( N % 10_000 )      / 1_000       ;
    c[ 2 ] = ( N % 1_000 )       / 100         ;
    c[ 1 ] = ( N % 100 )         / 10          ;
    c[ 0 ] =   N % 10                          ;

    int digitSum = c[0] + c[1] + c[2] + c[3] +
                   c[4] + c[5] + c[6] + c[7] + c[8]  ;

    System.out.println( N % digitSum == 0 ? "Yes" : "No" );
  }
}