Submission #857054

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
using namespace std;
using ll = long long;

ll n, s;

ll f(ll b, ll n) {
    ll res = 0;
    while (n) {
        res += n%b;
        n /= b;
    }
    return res;
}

int main() {
    while (cin >> n >> s) {
        ll ans = -1;
        if (s == 1) ans = n;
        for (ll b = 2; b <= 1000000; ++b) {
            if (f(b, n) == s) {
                ans = b;
                break;
            }
        }
        cout << ans << endl;
    }
}

Submission Info

Judge Result