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: Time Limit Exceeded)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int a,b,c,d,e,f,g,h,i,fx ;
		String ans = " " ;

		for (int x = 1 ; x <= N ; x++) {
			a = x % 10 ; //1の位
			b = (x/10) % 10 ; //10の位
			c = (x/100) % 10 ; //100の位
			d = (x/1000) % 10 ; //1000の位
			e = (x/10000) % 10 ; //10000の位
			f =  (x/100000) % 10 ; //100000の位
			g = (x/1000000) % 10 ; //1000000の位
			h = (x/10000000) % 10 ; //10000000の位
			i = (x/100000000) % 10 ; //100000000の位
			fx = a+b+c+d+e+f+g+h+i ;

			if ( N % fx == 0 ) {
				ans = "Yes" ;
			} else {
				ans = "No" ;
			}
		}
		System.out.println(ans);
	}
}