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>
#include<math.h>
using namespace std;

int main(){
  int N,Sn[10],s=0;


while(1){
  std::cin >> N;
  if(N>=1&&N<=1000000000) break;}

  int N_x=N;
  int x=1,i=0;

  while(N_x/10>0){

    N_x=N_x/10;
    x++;
  }

  while(i<x){
    if(i==0)Sn[i]=N%10;
    else Sn[i]=N/pow(10,i);
    
    s=s+Sn[i];
    i++;
  }


  if(N%s==0) std::cout << "Yes" << '\n';
  else std::cout << "No" << '\n';


}