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)

#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <vector>
#include <queue>
#include <functional>

#define ll long long int
#define loop(a, n) for(int a = 0; a < n; ++a)
#define INF 114514//1919810
#define OUT std::cout
#define IN std::cin
#define itn int
#define fro for
#define sdt std

#define MAX_D 1234
#define MAX_N 1234

ll N, ans = 0, buf;


int main()
{
	
	IN >> N;

	loop(a, 9)
	{
		buf = 1;
		loop(b, a + 1) buf *= 10;
		
		ans += (N % buf) / (buf / 10);
	}


	if (N % ans == 0) puts("Yes");
	else puts("No");

	return 0;
}