Problem:
Score : 200 points

Problem Statement

An integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.

Given an integer N, determine whether it is a Harshad number.

Constraints

1?N?10^8

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print Yes if N is a Harshad number; print No otherwise.

Sample Input 1

12

Sample Output 1

Yes

f(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.

Sample Input 2

57

Sample Output 2

No

f(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.

Sample Input 3

148

Sample Output 3

No

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
using namespace std;

int main() {
  int N, N_fake; // 入力の数字
  int order;
  int output;
  cin >> N;
  N_fake = N;
  
  // 桁数を求める
  for (int i = 0; i < 10; i++){
    N_fake = N_fake / 10;
    if (N_fake == 0){
      break;
    }
    order ++;
  }
  
  // cout << "桁数は:" << order+1 << endl;

  N_fake = N;
  for (int i = 0; i < order+1; i++){
    int test;
    test = N_fake / std::pow(10,order-i);
    N_fake -= test * std::pow(10,order-i);
    // cout << test << endl; //
    output += test;
  }
  // cout << output << endl;
  if (N % output == 0){
    cout << "Yes" << endl;
  }
  else{
  	cout << "No" << endl;
  }
}