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>

int main(void)
{
	int N;
	int S;
	int hund = 0;
	int ten = 0;
	int one = 0;
	
	scanf("%d",&N);
	
	
	
	hund = N / 100;
	
	ten = (N - hund * 100) / 10;
	
	one = (N - (hund * 100 + ten * 10));
	
	S = hund + ten + one;
	
	if(N % S == 0){
		printf("Yes\n");
	}
	
	else if(N % S >= 1){
		printf("No\n");
	}
	
	return(0);
}