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: Accepted)

#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
   string N;
   cin>> N;
    int S,x;
    S=0;
    x=0;
     for(unsigned int i=0;i<N.size();i++){
        S += N.at(i)-'0';
         x += (N.at(i)-'0')*pow(10,N.size()-i-1);
     }

 if(x%S==0){
        cout<<"Yes"<<endl;
    }
    else{
        cout<<"No"<<endl;
      
    }
    
 
   
    
}
//なんで-48を入れなきゃ合わないのかわからない(unsigned int  math.hの影響？)
//入力例を入れたときは違う結果が出てたのにＡＣななった理由がわからない
//unsigned intは０も範囲内？