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: Wrong Answer)

#include<stdio.h>
#include<math.h>
#include<string.h>
int main(){
	long a,b,c,d,i,j,k,r[1000];
	scanf("%ld",&a);
	b=a;
	r[0]=b%10;
	for(c=1;b>9;c++){
		b/=10;
		r[c]=b%10;
	}
	d=0;
	for(i=0;i<c;i++){
		d+=r[i];
	}
	if(a%d==0){
		printf("Yes\n\n输入N = %ld. S(%ld) = %ld",a,a,r[c-1]);
		for(i=c-2;i>=0;i--){
			printf(" + %ld",r[i]);
		}
		printf(" = %ld, S(N) 能整除 N.",d);
	}
	else{
		printf("No\n\nS(%ld) = %ld",a,r[c-1]);
		for(i=c-2;i>=0;i--){
			printf(" + %ld",r[i]);
		}
		printf(" = %ld, S(N) 不能整除 N.\n",d);
	}
	return 0; 
}