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.Scanner;

public class Main {
	public static void main(String[] args) {
		int x = 0;
		int sum = 0;
		
		Scanner sn = new Scanner(System.in);
		int n = sn.nextInt();
		if(1 <= n && n <= Math.pow(10, 8)){
			x = n;
		}
		sn.close();
		sum = calc(x);
		
		if( x % sum == 0){
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
	
	public static int calc(int x){
		int sum = 0;
		String xStr = Integer.toString(x);
		int k = xStr.length();
		while(k != 0){
			String c = xStr.substring(k-1, k);
			sum = sum + Integer.parseInt(c);
			k--;
		}
		return sum;
	}
}