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 <cstdio>
#include <cmath>

long long llpow(long long a, long long b){
    long long res = 1;
    for(long long i = 0; i<b; i++){
        res *= 10;
    }

    return res;
}


int main(){
    long long N;
    scanf("%lld", &N);

    long long res = 0;
    long long one = 1;
    long long nine = 9;
    long long ten = 10; 
    for(long long i=0; i<nine; i+=one){
        long long hoge = llpow(ten, i);
        if(hoge > N){
            ;
        }else{
            res += (N / hoge) % ten;
        }
    }

    long long zero = 0;
    if(N % res == zero){
        printf("Yes\n");
    }else{
        printf("No\n");
    }

    return 0;
}