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>

int main(int argc, char const *argv[]) {
  long N = 0;
  long S = 0;
  //入力
  scanf("%ld", &N );
  //計算
  long ans = N;
  for (size_t i = 0; i < 9; i++) {
    S += N%10;
    N = N/10;
  }
  //出力
  if ( S == 0 ) {
    printf("Yes\n");
  } else if ( (ans%S) == 0 ) {
    printf("Yes\n");
  } else {
    printf("No\n");
  }
  return 0;
}