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;
using System.Collections.Generic;
using System.Linq;

namespace ABC
{
    class Program
    {
        public static void Main(string[] args)
        {
			var n = int.Parse(Console.ReadLine());
			var nn = n;
			var sum = 0;
			var len = 1;
			var dig = 0;

			for (int i = n; i >= 10; i /= 10)
			{
				len++;
			}

			for (var i = 0; i < len; i++) {
				dig = n % 10;
                sum = sum + dig;
                n = n / 10;
            }

			if(nn % sum == 0){
				Console.WriteLine("Yes");
			}
			else
			{
				Console.WriteLine("No");
			}

		}
    }
}