BOJ 16861 - Harshad Numbers [C++]

문제

링크

풀이

#include <iostream>
using namespace std;
 
bool harshad(int n) {
  int sum = 0;
  for (int i=n; i>0; i/=10) sum += i % 10;
  return n % sum == 0;
}
 
void solve(void) {
  int n; cin >> n;
 
  while (!harshad(n)) n++;
  cout << n;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}