스터디/알고리즘

[백준 2231] 분해합

덩이 2022. 2. 11. 01:30
#include <iostream>
#include <algorithm>

using namespace std;

int main(){
    int n, sum, digit;

    cin >> n;

    for(int i=1; i<n; i++){
        sum = i;
        digit = i;
        while(digit){
            sum += digit % 10;
            digit /= 10;
        }
        if(n == sum){
            cout << i << endl;
            return 0;
        }
    }
    cout << "0" << endl;

    return 0;
}