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++ (GCC 5.4.1) (judge verdict: Wrong Answer)

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

int main() {
	int N, f1, f2, f3, f4, f5, f6, f7, fn;
	cin >> N;
	f1 = N % 10;
	f2 = (N % 100 - f1) / 10;
	f3 = (N % 1000 - f1 - f2) / 100;
	f4 = (N % 10000 - f1 - f2 - f3) / 1000;
	f7 = N / 10000000;
	f6 = N / 1000000 - 10 * f7;
	f5 = N / 100000 - 10 * f6 - 100 * f7;
	fn = f1 + f2 + f3 + f4 + f5 + f6 + f7;
	if(N % fn == 0) {
		cout << "Yes" << endl;
	} else { 
		cout << "No" << endl;
	}
}