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: Wrong Answer)

#include <stdio.h>
#include <math.h>
 
int main(void){
	int n,a,b,c,d,e,f,g,h;
	
	scanf("%d",&n);
	
	if(1<= n && n <=100000000){
		
		a = n/10000000;
		b = (n-a*10000000)/1000000;
		c = (n-a*10000000-b*1000000)/100000;
		d = (n-a*10000000-b*1000000-c*100000)/10000;
		e = (n-a*10000000-b*1000000-c*100000-d*10000)/1000;
		f = (n-a*10000000-b*1000000-c*100000-d*10000-e*1000)/100;
		g = n%10;
		
		h = a+b+c+d+e+f+g;
		
		if(n%h == 0){
			printf("Yes\n");
		}else{
			printf("No\n");
		}
		
	}
	return 0;
}