Problem:
Score : 200 points

Problem Statement

Let S(n) denote the sum of the digits in the decimal notation of n.
For example, S(101) = 1 + 0 + 1 = 2.

Given an integer N, determine if S(N) divides N.

Constraints

1 \leq N \leq 10^9

Input

Input is given from Standard Input in the following format:

N

Output

If S(N) divides N, print Yes; if it does not, print No.

Sample Input 1

12

Sample Output 1

Yes

In this input, N=12.
As S(12) = 1 + 2 = 3, S(N) divides N.

Sample Input 2

101

Sample Output 2

No

As S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.

Sample Input 3

999999999

Sample Output 3

Yes

Solution in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <math.h>
#include <string.h>

int main(void)
{
        int n,i,d,l;
        char s[10];

        scanf("%s",s);
        l=strlen(s);
        n=0;d=0;
        for(i=0;i<l;i++){
                d+=s[i]-'0';
                n+=(s[i]-'0')*pow(10,i);
        }

        if(n%d==0)printf("Yes\n");
        else printf("No\n");
        return 0;
}