Submission #11341892

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PL;
typedef pair<int,int> P;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const double pi = 3.1415926535;

int main() {
    ll n; cin >> n;
    vector<ll> ans;
    for (ll i = n - 153; i < n; i ++) {
        if (i <= 0) continue;
        ll num = i;
        int tmp = 0;
        while (num > 0) {
            tmp += num%10;
            num /= 10;
        }
        if (tmp + i == n) ans.push_back(i);
    }
    int l = ans.size();
    cout << l <<  endl;
    rep(i,l) cout << ans[i] << endl;
}

Submission Info

Judge Result