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 {

	/*
	 * 問題文 整数  n  に対して， n  
	 * を十進法で表したときの各桁の和を  
	 * S ( n )  で表すことにします． 
	 * たとえば， S ( 101 ) = 1 + 0 + 1 = 2  です．  
	 * 整数Nが与えられたとき， N  が  S ( N )  
	 * で割り切れるかどうかを判定してください．
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int input = sc.nextInt();
		int temp = input;
		int digitSum = 0;
		while(temp != 0) {
			digitSum += temp%10;
			temp /= 10;
		}
		if(input%digitSum == 0) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}

}