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 5.4.1) (judge verdict: Accepted)

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

int main(void)
{
    char S[5];
    int M,N;
    int i,j,t;

    scanf("%d",&M);
    N=M;
    j=0;
    j = j + N/1000000000;
    N=N-N/1000000000*1000000000;
    j = j + N/100000000;
    N=N-N/100000000*100000000;
    j = j + N/10000000;
    N=N-N/10000000*10000000;
    j = j + N/1000000;
    N=N-N/1000000*1000000;
    j = j + N/100000;
    N=N-N/100000*100000;
    j = j + N/10000;
    N=N-N/10000*10000;
    j = j + N/1000;
    N=N-N/1000*1000;
    j = j + N/100;
    N=N-N/100*100;
    j = j + N/10;
    N = N - N/10*10;
    j = j + N/1;

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