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: Runtime Error)

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

int main()
{
    int N, Sn, x;
    //char buf[100];

    printf("整数N:");
    if (scanf("%d", &N) == 1);

    if (N < 1 || N > pow(10, 9.0))
    {
        printf("Error: 1 ≦ N ≦ 10^9\n");
        return 1;
    }

    int y = N;
    while (N > 0)
    {
        x = N % 10;
        Sn += x;
        N /= 10;
    }
    printf("%d\n", Sn);
    if (y % Sn == 0)
    {
        printf("yes\n");
    }
    else
    {
        printf("No\n");
    }
    return 1;
}