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++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <bits/stdc++.h>
using namespace std;

long long NumberOfFigure(long long X){
	int count = 1;
	if(X > 9){
		count = 0;
		for(int i = 0; i < 9; i++){
			if(X == 0){
			break;
			}
			else{
			count += 1;
			X /= 10;
			}
		}
	}
	return count;
}

int Total_EachFigure(int X){
	int S = NumberOfFigure(X);
	int sum = 0;
	for( int i = 0; i < S; i++ ){
			sum += X % 10;
			X /= 10;
	}
	return sum;
}

int main(){
	long long N;
	cin >> N;
	
	long long sumN = Total_EachFigure(N);
	
	if(N % sumN == 0) cout << "Yes" << endl;
	else cout << "No" << endl;
}