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 <iostream>
#include <string>
using namespace std;

int main(void) {
	const int P[10] = { 0, 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000 };
	string S;

	cin >> S;
	int len = S.length();
	int N = 0;
	int H = 0;
	for (int i = 1; i <= len; ++i) {
		int c = (int)(S[i - 1] - '0');
		H += c;
		N += P[len - i + 1] * c;
	}

	if (N % H == 0)
		cout << "Yes\n";
	else
		cout << "No\n";
	return 0;
}