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

#include <stdio.h>
main()
{
    long long int n,m,a[100];
	int i,j=0,k=0;

	scanf("%lld",&n);
	m=n;
	
    while(n!=0)
	{
	        k++;
		n=n/10;
	}
    n=m;
    for(i=0;i<k;i++)
	{
		a[i]=n%10;
		j=j+a[i];
		n=n/10;
	}
    if((m%j) == 0)
	{
		printf("Yes\n");
	}
    else
	{
		printf("No\n");
	}

    return 0;
}