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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System.Linq;
using System;

class Program
{
  static void Main() => new Program().solve();

  void solve()
  {
    var n = int.Parse(Console.ReadLine());
    var ans = (n % fun(n:n) == 0) ? "Yes" : "No";
    Console.WriteLine(ans);
  }

  int fun(int sum = 0, int n = 1)
  {
    if(n == 0) return sum;
    return fun(sum + n % 10, n / 10);
  }
}