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

#include <iostream>

using namespace std;

int main(void) {
  int N, tmp, Sn = 0;
  cin >> N;
  tmp = N;
  while (tmp > 0) {
    cout << tmp % 10 << " ";
    Sn += tmp % 10;
    tmp = tmp / 10;
  }
  cout << "\n";
  cout << N << " " << Sn << "\n";
  cout << N % Sn << "\n";
  if (N % Sn == 0) {
    cout << "Yes";
  } else {
    cout << "No";
  }
}