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: Accepted)

#include<bits/stdc++.h>
using namespace std;

int main(){
  int N,A,B,sum,s,k;
  
  sum = 0;
  s = 0;
  A = 1;
  
  cin >> N;
  k = N;
  
  //何桁の数か特定
  for(int i=1; i<=N; i*=10)
    s++;
  //桁数に合わせた数Aを出力
  for(int i=0; i<s-1;i++)
    A *=10;
  
  //各桁の和sumを計算
  for(int i=0; i<s;i++){
    B = k/A;
    k -= B*A;
    A /= 10;
    sum += B;

  }
  if(N%sum == 0)
    cout <<"Yes"<<endl;
  else 
    cout <<"No" <<endl;
}