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 9.2.1) (judge verdict: Accepted)

#include <bits/stdc++.h>

using namespace std;

int main(){
  int N, ketasuu,a ,b , sum =0;
  int kurai;
  kurai = 0;
  cin >> N;
  a = N;
  b = N;
  for(int i = 0;N != 0;i++){
    N  = N / 10;
    ketasuu = i + 1;
  }

  
  for(int i = 0;i < ketasuu ;i++){;
    sum = sum + a % 10;
    a = a / 10;
  }

  if(b % sum == 0){
    cout << "Yes" << endl;
  }else {
    cout << "No" << endl;
  }
}