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

#include <stdio.h>
#include <string.h>
#include <math.h>
int main(void){
    
    int i,a=0,b=0;
    char s[10];
    
    scanf("%s",s);
    
    for(i=0;i<strlen(s);i++){
        a=a+(s[i]-'0')*(int)pow(10,strlen(s)-i);
        b=b+s[i]-'0';
    }
    
    if(a%b==0) printf("Yes\n");
    else printf("No\n");
    
    return 0;
}