Problem:
Score : 200 points

Problem Statement

Let S(n) denote the sum of the digits in the decimal notation of n.
For example, S(101) = 1 + 0 + 1 = 2.

Given an integer N, determine if S(N) divides N.

Constraints

1 \leq N \leq 10^9

Input

Input is given from Standard Input in the following format:

N

Output

If S(N) divides N, print Yes; if it does not, print No.

Sample Input 1

12

Sample Output 1

Yes

In this input, N=12.
As S(12) = 1 + 2 = 3, S(N) divides N.

Sample Input 2

101

Sample Output 2

No

As S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.

Sample Input 3

999999999

Sample Output 3

Yes

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

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

		long number = sc.nextLong();

		long one = number % 10;
		long two = number % 100 - one;
		long three = number % 1000 - two - one;
		long four = number % 10000 - three - two - one;
		long five = number % 100000 - four - three - two - one;
		long six = number % 1000000 - five - four - three - two - one;
		long seven = number % 10000000 - six - five - four - three - two - one;
		long eight = number % 100000000 - seven - six - five - four - three - two - one;
		long nine = number % 1000000000 - eight - seven - six - five - four - three - two - one;
		long ten = number / 10 % 1000000000 - nine - eight - seven - six - five - four - three - two - one;

		long all = one + two / 10 + three / 100 + four / 1000 + five / 10000 + six / 100000 + seven / 1000000
				+ eight / 10000000 + nine / 100000000 + ten / 1000000000;


		sc.close();

		if (all == 0) {
			all += 1;
		}
		
		if (number % all == 0) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}

}