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>
#include <stdlib.h>

int main(){
	int i,c,sum=0,num=0,count=0;
	int *a;
	
	while((c=getchar())!=EOF){
		if(c=='\n'){
			break;
		}
		sum=c-48+sum;
		a[count]=c-48;
		count++;
	}
	
	for(i=0;i<count;i++){
		num=num+a[i]*pow(10,count-i-1);
	}
	
	printf("%d,%d,%d",sum,num,count);
	
	if((num%sum)==0){
		printf("Yes");
	}else{
		printf("No");
	}
	
	return 0;
	
}