Submission #14381346

---

Source Code Expand

#include <bits/stdc++.h>
#define INF 1e9
using namespace std;

#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a)  (a).begin(),(a).end()
#define endl "\n"

template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
typedef long long ll;

// powのll番
ll pow(ll a,ll b) {
    ll k = 1;
    REP(_,b) k*=a;
    return b;
}

void solve() {
    ll A;
    cin >> A;
    FOR(i,10,10001) {
        string str = to_string(i);
        ll ans = 0;
        REP(j,str.size()) {
            int p = str.size()-1-j;
            ans+=(pow(i,p)) * (str[j]-'0');
        }
        if (A==ans) {
            cout << i << endl;
            return;
        }
    }
    cout << -1 << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result