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 C++14 (GCC 5.4.1) (judge verdict: Runtime Error)

/*
  AtCoder Beginner Contest 080
  B - Harshad Number

  方針
    各桁の数字の和をどのように計算すればよいか。
    1の位を確認した後、10で割る操作を繰り返す。

  実装
    最後にX % f(X)を計算するため、Xのバッファを用意して、
    そのバッファに対して上述の操作を行う。
*/

#include<iostream>
using namespace std;

int X;

int main() {
  int sum_digits = 0;
  int bufX = X;
  while (bufX != 0) {
    sum_digits += bufX % 10;
    bufX /= 10;
  }

  if (X % sum_digits == 0) printf("Yes\n");
  else printf("No\n");
  return 0;
}