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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <stdio.h>
int main(void) {
	int a=0, b=0, c=0,d, i,j,sum=0,ke=0;
	int n[6];
	scanf("%d %d %d", &a, &b, &c);
	for (i = 1;i<=a;i++) {
		ke = 0;
		d = i;
		n[0] = d / 10000;
		n[1] = (d-n[0]*10000) / 1000;
		n[2] = (d -n[0]*10000- n[1]*1000) / 100;
		n[3] = (d - n[0] * 10000 - n[1] * 1000 - n[2]*100) / 10;
		n[4] = (d - n[0] * 10000 - n[1] * 1000 - n[2] * 100 - n[3]*10);
		n[5] = (d - n[0] * 10000 - n[1] * 1000 - n[2] * 100 - n[3] * 10-n[4]);
		for (j = 0;j < 5;j++) {
			ke += n[j];
		}
		if (b <= ke&&ke <= c) {
			sum += i;
		}
	}

	printf("%d\n",sum);
	


}